Sciweavers

1272 search results - page 226 / 255
» The Set Cover with Pairs Problem
Sort
View
ESA
2009
Springer
129views Algorithms» more  ESA 2009»
14 years 4 months ago
Dynamic vs. Oblivious Routing in Network Design
Consider the robust network design problem of finding a minimum cost network with enough capacity to route all traffic demand matrices in a given polytope. We investigate the impa...
Navin Goyal, Neil Olver, F. Bruce Shepherd
MM
2010
ACM
178views Multimedia» more  MM 2010»
13 years 10 months ago
Topical summarization of web videos by visual-text time-dependent alignment
Search engines are used to return a long list of hundreds or even thousands of videos in response to a query topic. Efficient navigation of videos becomes difficult and users ofte...
Song Tan, Hung-Khoon Tan, Chong-Wah Ngo
COR
2010
146views more  COR 2010»
13 years 10 months ago
A search space "cartography" for guiding graph coloring heuristics
We present a search space analysis and its application in improving local search algorithms for the graph coloring problem. Using a classical distance measure between colorings, w...
Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz
CORR
2008
Springer
91views Education» more  CORR 2008»
13 years 10 months ago
Natural pseudo-distance and optimal matching between reduced size functions
We study a dissimilarity measure between shapes, expressed by the natural pseudodistance between size pairs, where a shape is viewed as a topological space endowed with a real-val...
Michele d'Amico, Patrizio Frosini, Claudia Landi
CSDA
2006
71views more  CSDA 2006»
13 years 10 months ago
Practical representations of incomplete probabilistic knowledge
This article deals with the compact representation of incomplete probabilistic knowledge which can be encountered in risk evaluation problems, for instance in environmental studie...
Cédric Baudrit, Didier Dubois