15033 search results - page 103 / 3007 » Complexity Theory and Algorithms |
305
click to vote
COMPGEOM
2011
ACM
14 years 10 months ago
2011
ACM
We propose a framework for compressive sensing of images with local geometric features. Specifically, let x ∈ RN be an N-pixel image, where each pixel p has value xp. The image...
169
click to vote
ISSAC
2005
Springer
16 years 8 days ago
2005
Springer
We present lifting techniques for triangular decompositions of zero-dimensional varieties, that extend the range of the previous methods. We discuss complexity aspects, and report...
211
Voted
ACID
2006
15 years 8 months ago
2006
Matroid theory gives us powerful techniques for understanding combinatorial optimization problems and for designing polynomial-time algorithms. However, several natural matroid pr...
201
Voted
STOC
2007
ACM
16 years 7 months ago
2007
ACM
We present a polynomial time approximation scheme (PTAS) for the minimum feedback arc set problem on tournaments. A simple weighted generalization gives a PTAS for KemenyYoung ran...
163
click to vote
PODS
2006
ACM
16 years 6 months ago
2006
ACM
We initiate a novel study of clustering problems. Rather than specifying an explicit objective function to optimize, our framework allows the user of clustering algorithm to speci...