Skip to search formSkip to main content

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

2011

2011

In this paper, we consider the classical NP-complete VERTEX COVER problem in large graphs. We assume that the size and the access… Expand

Is this relevant?

Highly Cited

2008

Highly Cited

2008

Many data analysis applications deal with large matrices and involve approximating the matrix using a small number of “components… Expand

Is this relevant?

2005

2005

c © 2006 by John von Neumann Institute for Computing Permission to make digital or hard copies of portions of this work for… Expand

Is this relevant?

Highly Cited

2004

Highly Cited

2004

A proposed performance model for superscalar processors consists of: 1) a component that models the relationship between… Expand

Is this relevant?

Highly Cited

2003

Highly Cited

2003

In this paper, we consider a problem that arises in black box testing: generating small test suites (i.e., sets of test cases… Expand

Is this relevant?

Highly Cited

2002

Highly Cited

2002

Summary. We analyze a space-time domain decomposition iteration, for a model advection diffusion equation in one and two… Expand

Is this relevant?

Highly Cited

2001

Highly Cited

2001

We consider the problem of substring searching in large databases. Typical applications of this problem are genetic data, web… Expand

Is this relevant?

2001

2001

We describe the use of the mobile agent paradigm to design an improved infrastructure for data integration in Distributed Sensor… Expand

Is this relevant?

Highly Cited

2000

Highly Cited

2000

Abstract This paper presents new algorithms for the extraction of association rules from binary databases. Most existing methods… Expand

Is this relevant?

Highly Cited

1997

Highly Cited

1997

The paper presents a new model of query and computation on the Web. We focus on two important aspects that distinguish the access… Expand

Is this relevant?