Sciweavers

169 search results - page 24 / 34
» The Tree of Hubs Location Problem
Sort
View
CVPR
2007
IEEE
16 years 3 months ago
Approximate Nearest Subspace Search with Applications to Pattern Recognition
Linear and affine subspaces are commonly used to describe appearance of objects under different lighting, viewpoint, articulation, and identity. A natural problem arising from the...
Ronen Basri, Tal Hassner, Lihi Zelnik-Manor
141
Voted
FOCS
2004
IEEE
15 years 5 months ago
Stochastic Optimization is (Almost) as easy as Deterministic Optimization
Stochastic optimization problems attempt to model uncertainty in the data by assuming that (part of) the input is specified in terms of a probability distribution. We consider the...
David B. Shmoys, Chaitanya Swamy
SODA
1990
ACM
114views Algorithms» more  SODA 1990»
15 years 3 months ago
Finding Steiner Forests in Planar Graphs
Given an unweighted planar graph G together with nets of terminals, our problem is to find a Steiner forest, i.e., vertex-disjoint trees, each of which interconnects all the termin...
Hitoshi Suzuki, Takehiro Akama, Takao Nishizeki
CIKM
2005
Springer
15 years 3 months ago
Handling frequent updates of moving objects
A critical issue in moving object databases is to develop appropriate indexing structures for continuously moving object locations so that queries can still be performed efficien...
Bin Lin, Jianwen Su
139
Voted
ICALP
2010
Springer
15 years 6 months ago
Thresholded Covering Algorithms for Robust and Max-min Optimization
The general problem of robust optimization is this: one of several possible scenarios will appear tomorrow, but things are more expensive tomorrow than they are today. What should...
Anupam Gupta, Viswanath Nagarajan, R. Ravi