7006 search results - page 342 / 1402 » Approximation Algorithms |
172
click to vote
ICASSP
2011
IEEE
14 years 8 months ago
2011
IEEE
The construction of low-dimensional models explaining highdimensional signal observations provides concise and efficient data representations. In this paper, we focus on pattern ...
121
click to vote
ICML
2009
IEEE
16 years 5 months ago
2009
IEEE
Recent approaches to learning structured predictors often require approximate inference for tractability; yet its effects on the learned model are unclear. Meanwhile, most learnin...
160
click to vote
FOCS
2009
IEEE
15 years 11 months ago
2009
IEEE
We show that a k-fold covering using translates of an arbitrary convex polygon can be decomposed into Omega(k) covers (using an efficient algorithm). We generalize this result to ...
130
click to vote
SIGCOMM
1999
ACM
15 years 8 months ago
1999
ACM
The conventional approach to routing in computer networks consists of using a heuristic to compute a single shortest path from a source to a destination. Single-path routing is ve...
158
click to vote
DAM
2011
14 years 11 months ago
2011
In this paper we tackle the problem of matching two colored point sets in R3 under the bottleneck distance. First we present an exact matching algorithm that requires the computat...