Sciweavers

2606 search results - page 235 / 522
» cost 2008
Sort
View
169
Voted
SODA
2008
ACM
89views Algorithms» more  SODA 2008»
15 years 8 months ago
Earth mover distance over high-dimensional spaces
The Earth Mover Distance (EMD) between two equalsize sets of points in Rd is defined to be the minimum cost of a bipartite matching between the two pointsets. It is a natural metr...
Alexandr Andoni, Piotr Indyk, Robert Krauthgamer
SODA
2008
ACM
100views Algorithms» more  SODA 2008»
15 years 8 months ago
Maintaining deforming surface meshes
We present a method to maintain a mesh approximating a deforming surface, which is specified by a dense set of sample points. We identify a reasonable motion model for which a pro...
Siu-Wing Cheng, Tamal K. Dey
ADHOCNOW
2008
Springer
15 years 7 months ago
An Energy-Efficient Query Aggregation Scheme for Wireless Sensor Networks
This paper presents a novel method for optimizing sliding window based continuous queries. We deal with two categories of aggregation operations: stepwise aggregation (e.g. COUNT) ...
Jun-Zhao Sun
CRYPTO
2010
Springer
110views Cryptology» more  CRYPTO 2010»
15 years 7 months ago
An Efficient and Parallel Gaussian Sampler for Lattices
At the heart of many recent lattice-based cryptographic schemes is a polynomial-time algorithm that, given a `high-quality' basis, generates a lattice point according to a Ga...
Chris Peikert
GECCO
2008
Springer
156views Optimization» more  GECCO 2008»
15 years 7 months ago
Computing minimum cuts by randomized search heuristics
We study the minimum s-t-cut problem in graphs with costs on the edges in the context of evolutionary algorithms. Minimum cut problems belong to the class of basic network optimiz...
Frank Neumann, Joachim Reichel, Martin Skutella