2957 search results - page 138 / 592 » The Complexity of Polynomial-Time Approximation |
158
Voted
SSD
2005
Springer
15 years 10 months ago
2005
Springer
In this paper we discuss a new type of query in Spatial Databases, called the Trip Planning Query (TPQ). Given a set of points of interest P in space, where each point belongs to ...
149
click to vote
CORR
2007
Springer
15 years 5 months ago
2007
Springer
Many data analysis applications deal with large matrices and involve approximating the matrix using a small number of “components.” Typically, these components are linear combi...
179
click to vote
AIIA
1991
Springer
15 years 8 months ago
1991
Springer
The use of approximation as a method for dealing with complex problems is a fundamental research issue in Knowledge Representation. Using approximation in symbolic AI is not strai...
130
click to vote
ISSAC
2009
Springer
15 years 11 months ago
2009
Springer
In this work we relate the deterministic complexity of factoring polynomials (over finite fields) to certain combinatorial objects, we call m-schemes, that are generalizations o...
128
Voted
COMPGEOM
2010
ACM
15 years 10 months ago
2010
ACM
Sampling conditions for recovering the homology of a set using topological persistence are much weaker than sampling conditions required by any known algorithm for producing a top...