7015 search results - page 264 / 1403 » Approximation algorithms for co-clustering |
178
click to vote
SODA
2008
ACM
15 years 8 months ago
2008
ACM
The Traveling Salesman Problem (TSP) is a canonical NP-complete problem which is known to be MAXSNP hard even on Euclidean metrics (of high dimensions) [40]. In order to circumven...
175
click to vote
AAAI
1997
1997
Combining Approximate Front End Signal Processing with Selective Reprocessing in Auditory Perception
15 years 8 months ago
When dealing with signals from complex environments, where multiple time-dependent signal signatures can interfere with each other in stochastically unpredictable ways, traditiona...
165
click to vote
SIAMCOMP
2008
15 years 6 months ago
2008
Our goal is to find an approximate shortest path for a point robot moving in a planar subdivision with n vertices. Let 1 be a real number. Distances in each face of this subdivis...
155
click to vote
ICIAR
2010
Springer
15 years 11 months ago
2010
Springer
The structural similarity (SSIM) index has been shown to be an useful tool in a wide variety of applications that involve the assessment of image quality and similarity. However, i...
159
click to vote
COCO
2001
Springer
15 years 11 months ago
2001
Springer
We study the complexity of approximating the VC dimension of a collection of sets, when the sets are encoded succinctly by a small circuit. We show that this problem is • Σp 3-...