Sciweavers

291 search results - page 56 / 59
» Constraint Satisfaction: The Approximability of Minimization...
Sort
View
MANSCI
2008
119views more  MANSCI 2008»
13 years 7 months ago
Service-Level Differentiation in Call Centers with Fully Flexible Servers
We study large-scale service systems with multiple customer classes and many statistically identical servers. The following question is addressed: How many servers are required (s...
Itay Gurvich, Mor Armony, Avishai Mandelbaum
GRAPHICSINTERFACE
2008
13 years 9 months ago
Background estimation from non-time sequence images
We address the problem of reconstructing the background of a scene from a set of photographs featuring several occluding objects. We assume that the photographs are obtained from ...
Miguel Granados, Hans-Peter Seidel, Hendrik P. A. ...
SPAA
2003
ACM
14 years 27 days ago
Short length menger's theorem and reliable optical routing
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
Amitabha Bagchi, Amitabh Chaudhary, Petr Kolman
SIGMOD
2012
ACM
203views Database» more  SIGMOD 2012»
11 years 10 months ago
Optimizing index for taxonomy keyword search
Query substitution is an important problem in information retrieval. Much work focuses on how to find substitutes for any given query. In this paper, we study how to efficiently ...
Bolin Ding, Haixun Wang, Ruoming Jin, Jiawei Han, ...
SIGGRAPH
2010
ACM
14 years 4 days ago
Paneling architectural freeform surfaces
The emergence of large-scale freeform shapes in architecture poses big challenges to the fabrication of such structures. A key problem is the approximation of the design surface b...
Michael Eigensatz, Martin Kilian, Alexander Schift...