Sciweavers

2722 search results - page 517 / 545
» Hastily formed networks
Sort
View
101
Voted
STOC
2004
ACM
150views Algorithms» more  STOC 2004»
16 years 29 days ago
Typical properties of winners and losers in discrete optimization
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
René Beier, Berthold Vöcking
VLDB
2007
ACM
141views Database» more  VLDB 2007»
16 years 26 days ago
Query Processing over Incomplete Autonomous Databases
Incompleteness due to missing attribute values (aka "null values") is very common in autonomous web databases, on which user accesses are usually supported through media...
Garrett Wolf, Hemal Khatri, Bhaumik Chokshi, Jianc...
93
Voted
EDBT
2008
ACM
150views Database» more  EDBT 2008»
16 years 23 days ago
Finding time-dependent shortest paths over large graphs
The spatial and temporal databases have been studied widely and intensively over years. In this paper, we study how to answer queries of finding the best departure time that minim...
Bolin Ding, Jeffrey Xu Yu, Lu Qin
87
Voted
ICFP
2003
ACM
16 years 18 days ago
Dynamic rebinding for marshalling and update, with destruct-time?
Most programming languages adopt static binding, but for distributed programming an exclusive reliance on static binding is too restrictive: dynamic binding is required in various...
Gavin M. Bierman, Michael W. Hicks, Peter Sewell, ...
98
Voted
EDBT
2010
ACM
185views Database» more  EDBT 2010»
15 years 7 months ago
Optimizing joins in a map-reduce environment
Implementations of map-reduce are being used to perform many operations on very large data. We examine strategies for joining several relations in the map-reduce environment. Our ...
Foto N. Afrati, Jeffrey D. Ullman