2569 search results - page 352 / 514 » Approximate Objects and Approximate Theories |
204
click to vote
ALGORITHMICA
2011
14 years 10 months ago
2011
Algorithms for determining quality/cost/price tradeoffs in saturated markets are consid-3 ered. A product is modeled by d real-valued qualities whose sum determines the unit cost ...
236
click to vote
ICALP
2011
Springer
14 years 10 months ago
2011
Springer
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
220
click to vote
COMGEO
2012
ACM
14 years 2 months ago
2012
ACM
We study a class of multi-commodity flow problems in geometric domains: For a given planar domain P populated with obstacles (holes) of K ≥ 2 types, compute a set of thick path...
176
click to vote
SODA
2012
ACM
13 years 9 months ago
2012
ACM
The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite by deleting at most k of its vertices. In a breakthrough result Reed, Smith, and Vetta (Op...
174
click to vote
ICCV
2009
IEEE
16 years 11 months ago
2009
IEEE
Local experts have been used to great effect for fitting deformable
models to images. Typically, the best location in
an image for the deformable model’s landmarks are found
t...