Sciweavers

1982 search results - page 87 / 397
» Designing Efficient Distributed Algorithms Using Sampling Te...
Sort
View
134
Voted
CIKM
2006
Springer
15 years 4 months ago
Processing relaxed skylines in PDMS using distributed data summaries
Peer Data Management Systems (PDMS) are a natural extension of heterogeneous database systems. One of the main tasks in such systems is efficient query processing. Insisting on co...
Katja Hose, Christian Lemke, Kai-Uwe Sattler
113
Voted
ICPP
1998
IEEE
15 years 6 months ago
Parallel Algorithms for Airline Crew Planning on Networks of Workstations
The crew planning problem has been successfully solved on a loosely connected network of workstations (NOW) using advanced computational techniques and efficient communication pat...
Christos Goumopoulos, Panayiotis Alefragis, Efthym...
MOR
2007
149views more  MOR 2007»
15 years 2 months ago
LP Rounding Approximation Algorithms for Stochastic Network Design
Real-world networks often need to be designed under uncertainty, with only partial information and predictions of demand available at the outset of the design process. The field ...
Anupam Gupta, R. Ravi, Amitabh Sinha
118
Voted
TKDE
1998
122views more  TKDE 1998»
15 years 2 months ago
The Design and Implementation of Seeded Trees: An Efficient Method for Spatial Joins
—Existing methods for spatial joins require pre-existing spatial indices or other precomputation, but such approaches are inefficient and limited in generality. Operand data sets...
Ming-Ling Lo, Chinya V. Ravishankar
129
Voted
COMPGEOM
2010
ACM
15 years 6 months ago
Manifold reconstruction using tangential Delaunay complexes
We give a provably correct algorithm to reconstruct a kdimensional manifold embedded in d-dimensional Euclidean space. Input to our algorithm is a point sample coming from an unkn...
Jean-Daniel Boissonnat, Arijit Ghosh