6274 search results - page 116 / 1255 » From query complexity to computational complexity |
139
click to vote
COMPGEOM
2010
ACM
15 years 7 months ago
2010
ACM
We give a provably correct algorithm to reconstruct a kdimensional manifold embedded in d-dimensional Euclidean space. Input to our algorithm is a point sample coming from an unkn...
108
click to vote
EUROCAST
2005
Springer
2005
Springer
Similarity Queries in Data Bases Using Metric Distances - from Modeling Semantics to Its Maintenance
15 years 9 months ago
Similarity queries in traditional databases work directly on attribute values. But, often similar attribute values do not indicate similar meanings. Semantic background information...
131
click to vote
COCO
2010
Springer
15 years 7 months ago
2010
Springer
Abstract—We consider two natural extensions of the communication complexity model that are inspired by distributed computing. In both models, two parties are equipped with synchr...
147
click to vote
BMCBI
2010
15 years 4 months ago
2010
Background: The information provided by dense genome-wide markers using high throughput technology is of considerable potential in human disease studies and livestock breeding pro...
130
click to vote
FOCS
2007
IEEE
15 years 10 months ago
2007
IEEE
In this paper, we resolve the smoothed and approximative complexity of low-rank quasi-concave minimization, providing both upper and lower bounds. As an upper bound, we provide th...