291 search results - page 55 / 59 » Constraint Satisfaction: The Approximability of Minimization... |
TON
2010
13 years 2 months ago
2010
Disruption tolerant networks rely on intermittent contacts between mobile nodes to deliver packets using a storecarry-and-forward paradigm. We earlier proposed the use of throwbox ...
CVPR
2011
IEEE
13 years 1 months ago
2011
IEEE
We propose a reduced algebraic cost based on pairwise epipolar constraints for the iterative refinement of a multiple view 3D reconstruction. The aim is to accelerate the intermedi...
SIGMOD
2011
ACM
12 years 10 months ago
2011
ACM
Scheduling data processing workflows (dataflows) on the cloud is a very complex and challenging task. It is essentially an optimization problem, very similar to query optimizati...
ECCC
2007
13 years 7 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...
ESA
2010
Springer
13 years 8 months ago
2010
Springer
We study the problem of estimating the average of a Lipschitz continuous function f defined over a metric space, by querying f at only a single point. More specifically, we explore...