Sciweavers

16091 search results - page 63 / 3219
» Solving
Sort
View
SPIRE
2010
Springer
13 years 6 months ago
Why Large Closest String Instances Are Easy to Solve in Practice
We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization versio...
Christina Boucher, Kathleen Wilkie
CIKM
2010
Springer
13 years 5 months ago
Web search solved?: all result rankings the same?
The objective of this work is to derive quantitative statements about what fraction of web search queries issued to the state-of-the-art commercial search engines lead to excellen...
Hugo Zaragoza, Berkant Barla Cambazoglu, Ricardo A...
ISAAC
2010
Springer
253views Algorithms» more  ISAAC 2010»
13 years 5 months ago
Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut
Abstract. We consider the Steiner tree problem under a 2-stage stochastic model with recourse and finitely many scenarios (SSTP). Thereby, edges are purchased in the first stage wh...
Immanuel M. Bomze, Markus Chimani, Michael Jü...
ANOR
2010
153views more  ANOR 2010»
13 years 5 months ago
Solving the Rectangular assignment problem and applications
The rectangular assignment problem is a generalization of the linear assignment problem (LAP): one wants to assign a number of persons to a smaller number of jobs, minimizing the ...
J. Bijsterbosch, A. Volgenant
CVPR
2011
IEEE
13 years 3 months ago
Local Isomorphism to Solve the Pre-image Problem in Kernel Methods
Kernel methods have been popular over the last decade to solve many computer vision, statistics and machine learning problems. An important, both theoretically and practically, op...
Dong Huang, Yuandong Tian, Fernando DelaTorre