4843 search results - page 468 / 969 » The Shortcut Problem - Complexity and Approximation |
172
click to vote
ISMIR
2005
Springer
15 years 11 months ago
2005
Springer
We describe a recursive algorithm to quickly compute the N nearest neighbors according to a similarity measure in a metric space. The algorithm exploits an intrinsic property of a...
149
Voted
ISAAC
2004
Springer
15 years 11 months ago
2004
Springer
Assuming 3-SAT formulas are hard to refute with high probability, Feige showed approximation hardness results, among others for the max bipartite clique. We extend this result in t...
149
click to vote
HICSS
2003
IEEE
15 years 11 months ago
2003
IEEE
In the paper, we propose a general method for statistical performance evaluation. The method incorporates various statistical metrics and automatically selects an appropriate stat...
151
click to vote
INFOCOM
1997
IEEE
15 years 10 months ago
1997
IEEE
Replication is a commonly proposed solution to problems of scale associated with distributed services. However, when a service is replicated, each client must be assigned a server...
145
click to vote
COMPGEOM
2005
ACM
15 years 8 months ago
2005
ACM
We consider the problem of discovering a smooth unknown surface S bounding an object O in R3 . The discovery process consists of moving a point probing device in the free space ar...