7006 search results - page 274 / 1402 » Approximation Algorithms |
108
click to vote
SODA
2010
ACM
16 years 1 months ago
2010
ACM
If a two-player social welfare maximization problem does not admit a PTAS, we prove that any maximal-in-range truthful mechanism that runs in polynomial time cannot achieve an app...
150
Voted
PAKDD
2009
ACM
16 years 29 days ago
2009
ACM
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-...
123
Voted
IPSN
2007
Springer
15 years 10 months ago
2007
Springer
We consider the problem of approximating a family of isocontours in a sensor field with a topologically-equivalent family of simple polygons. Our algorithm is simple and distribu...
126
Voted
APPROX
2005
Springer
15 years 9 months ago
2005
Springer
A caterpillar is a tree in which all vertices of degree three or more lie on one path, called the backbone. We present a polynomial time algorithm that produces a linear arrangeme...
220
click to vote
ICDE
1996
IEEE
16 years 5 months ago
1996
IEEE
Many new database application domains such as experimental sciences and medicine are characterized by large sequences as their main form of data. Using approximate representation ...