Sciweavers

4131 search results - page 146 / 827
» The Generalized Max-Controlled Set Problem
Sort
View
151
Voted
SODA
2001
ACM
188views Algorithms» more  SODA 2001»
15 years 4 months ago
Approximation algorithms for the 0-extension problem
In the 0-extension problem, we are given a weighted graph with some nodes marked as terminals and a semimetric on the set of terminals. Our goal is to assign the rest of the nodes ...
Gruia Calinescu, Howard J. Karloff, Yuval Rabani
132
Voted
EOR
2007
93views more  EOR 2007»
15 years 3 months ago
Exact algorithms for procurement problems under a total quantity discount structure
In this paper, we study the procurement problem faced by a buyer who needs to purchase a variety of goods from suppliers applying a so-called total quantity discount policy. This ...
Dries R. Goossens, A. J. T. Maas, Frits C. R. Spie...
CVPR
2007
IEEE
15 years 9 months ago
A Graph Reduction Method for 2D Snake Problems
Energy-minimizing active contour models (snakes) have been proposed for solving many computer vision problems such as object segmentation, surface reconstruction, and object track...
Jianhua Yan, Keqi Zhang, Chengcui Zhang, Shu-Ching...
142
Voted
ICALP
2007
Springer
15 years 9 months ago
Universal Algebra and Hardness Results for Constraint Satisfaction Problems
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
Benoit Larose, Pascal Tesson
149
Voted
ICDT
2010
ACM
205views Database» more  ICDT 2010»
15 years 8 months ago
On the Aggregation Problem for Synthesized Web Services
The paper formulates and investigates the aggregation problem for synthesized mediators of Web services (SWMs). An SWM is a finite-state transducer defined in terms of templates...
Ting Deng, Wenfei Fan, Leonid Libkin, Yinghui Wu