796 search results - page 70 / 160 » Approximating the centroid is hard |
158
click to vote
NETWORKS
2007
15 years 5 months ago
2007
This paper defines an incremental version of the maximum flow problem. In this model, the capacities increase over time and the resulting solution is a sequence of flows that b...
171
click to vote
BMVC
2010
15 years 4 months ago
2010
We present an approach for active segmentation based on integration of several cues. It serves as a framework for generation of object hypotheses of previously unseen objects in n...
111
click to vote
ICASSP
2011
IEEE
14 years 9 months ago
2011
IEEE
Unit selection synthesis inventories have coverage issues, which lead to missing syllable or diphone units. In the conventional back-off strategy of substituting the missing unit ...
217
click to vote
ECCC
2007
15 years 5 months ago
2007
In the undirected Edge-Disjoint Paths problem with Congestion (EDPwC), we are given an undirected graph with V nodes, a set of terminal pairs and an integer c. The objective is to...
163
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
We resolve an open question raised by Feige & Scheideler by showing that the best known approximation algorithm for flow shops is essentially tight with respect to the used low...