Sciweavers

3096 search results - page 398 / 620
» The Generalized FITC Approximation
Sort
View
ICALP
2010
Springer
15 years 11 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
SSDBM
2000
IEEE
109views Database» more  SSDBM 2000»
15 years 11 months ago
Toward Spatial Joins for Polygons
Efficient evaluation of spatial join is an important issue in spatial databases. The traditional evaluation strategy is to perform a join of “minimum bounding rectangles” (mbr...
Hongjun Zhu, Jianwen Su, Oscar H. Ibarra
AAAI
2007
15 years 8 months ago
Automated Online Mechanism Design and Prophet Inequalities
Recent work on online auctions for digital goods has explored the role of optimal stopping theory — particularly secretary problems — in the design of approximately optimal on...
Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Tu...
BIRD
2008
Springer
109views Bioinformatics» more  BIRD 2008»
15 years 8 months ago
A Robust Class of Stable Proteins in the 2D HPC Model
The inverse protein folding problem is that of designing an amino acid sequence which has a prescribed native protein fold. This problem arises in drug design where a particular st...
Alireza Hadj Khodabakhshi, Ján Manuch, Aras...
COMPGEOM
2008
ACM
15 years 8 months ago
Maximum thick paths in static and dynamic environments
We consider the problem of finding a maximum number of disjoint paths for unit disks moving amidst static or dynamic obstacles. For the static case we give efficient exact algorit...
Esther M. Arkin, Joseph S. B. Mitchell, Valentin P...