8647 search results - page 248 / 1730 » The Container Selection Problem |
137
Voted
CIAC
2000
Springer
15 years 8 months ago
2000
Springer
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...
117
Voted
CIKM
2008
Springer
15 years 5 months ago
2008
Springer
Web textual advertising can be interpreted as a search problem over the corpus of ads available for display in a particular context. In contrast to conventional information retrie...
139
Voted
FOCS
2008
IEEE
15 years 4 months ago
2008
IEEE
Given a universe U of n elements and a weighted collection S of m subsets of U, the universal set cover problem is to a-priori map each element u ∈ U to a set S(u) ∈ S contain...
190
Voted
TSMC
2008
15 years 3 months ago
2008
We present a method for the recovery of partially occluded 3D geometric primitives from range images which might also include non-primitive objects. The method uses a technique for...
130
Voted
CP
2004
Springer
15 years 9 months ago
2004
Springer
In real-life temporal scenarios, uncertainty and preferences are often essential, coexisting aspects. We present a formalism where temporal constraints with both preferences and un...