Sciweavers

1290 search results - page 117 / 258
» Popular Matchings: Structure and Algorithms
Sort
View
INFOCOM
2008
IEEE
16 years 25 days ago
On Survivable Access Network Design: Complexity and Algorithms
Abstract— We consider the computational complexity and algorithm challenges in designing survivable access networks. With limited routing capability, the structure of an access n...
Dahai Xu, Elliot Anshelevich, Mung Chiang
SIGIR
2000
ACM
15 years 10 months ago
Hill climbing algorithms for content-based retrieval of similar configurations
The retrieval of stored images matching an input configuration is an important form of content-based retrieval. Exhaustive processing (i.e., retrieval of the best solutions) of co...
Dimitris Papadias
DISOPT
2006
155views more  DISOPT 2006»
15 years 6 months ago
Cyclical scheduling and multi-shift scheduling: Complexity and approximation algorithms
We consider the multiple shift scheduling problem modelled as a covering problem. Such problems are characterized by a constraint matrix that has in every column blocks of consecu...
Dorit S. Hochbaum, Asaf Levin
ORL
2008
99views more  ORL 2008»
15 years 6 months ago
Some tractable instances of interval data minmax regret problems
This paper focuses on tractable instances of interval data minmax regret graph problems. More precisely, we provide polynomial and pseudopolynomial algorithms for sets of particul...
Bruno Escoffier, Jérôme Monnot, Olivi...
ICIP
2005
IEEE
16 years 8 months ago
Optimizing of searching co-motion point-pairs for statistical camera calibration
In the paper we introduce an algorithm for matching partially overlapping image-pairs where the object of interest is in motion, even if the motion is discontinuous and in an unstr...
Csaba Benedek, Laszlo Havasi, Tamás Szir&aa...