1554 search results - page 97 / 311 » Parameterized Complexity and Approximation Algorithms |
188
click to vote
COMPGEOM
2010
ACM
15 years 9 months ago
2010
ACM
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
180
click to vote
JCST
2008
15 years 3 months ago
2008
Detecting duplicates in data streams is an important problem that has a wide range of applications. In general, precisely detecting duplicates in an unbounded data stream is not fe...
133
click to vote
ECML
1993
Springer
15 years 8 months ago
1993
Springer
In machine learning theory, problem classes are distinguished because of di erences in complexity. In 6 , a stochastic model of learning from examples was introduced. This PAClear...
136
click to vote
COCO
1995
Springer
15 years 7 months ago
1995
Springer
Over a decade ago, Schoning introduced the concept of lowness into structural complexity theory. Since then a large body of results has been obtained classifying various complexit...
168
click to vote
AUTOMATICA
2008
15 years 4 months ago
2008
Fitting data by a bounded complexity linear model is equivalent to low-rank approximation of a matrix constructed from the data. The data matrix being Hankel structured is equival...