Sciweavers

2880 search results - page 300 / 576
» Approximate Range Searching
Sort
View
110
Voted
APPROX
2007
Springer
67views Algorithms» more  APPROX 2007»
15 years 9 months ago
Maximum Gradient Embeddings and Monotone Clustering
abstract Manor Mendel1 and Assaf Naor2 1 The Open University of Israel 2 Courant Institute Let (X, dX ) be an n-point metric space. We show that there exists a distribution D over ...
Manor Mendel, Assaf Naor
118
Voted
ICANNGA
2007
Springer
133views Algorithms» more  ICANNGA 2007»
15 years 9 months ago
Finding the Optimal Path in 3D Spaces Using EDAs - The Wireless Sensor Networks Scenario
Abstract. In wireless sensor networks where sensors are geographically deployed in 3D spaces, a mobile robot is required to travel to each sensor in order to download the data. The...
Bo Yuan, Maria E. Orlowska, Shazia Wasim Sadiq
122
Voted
WINE
2007
Springer
166views Economy» more  WINE 2007»
15 years 9 months ago
Gradient-Based Algorithms for Finding Nash Equilibria in Extensive Form Games
We present a computational approach to the saddle-point formulation for the Nash equilibria of two-person, zero-sum sequential games of imperfect information. The algorithm is a ...
Andrew Gilpin, Samid Hoda, Javier Peña, Tuo...
123
Voted
3DPVT
2006
IEEE
189views Visualization» more  3DPVT 2006»
15 years 9 months ago
Fast Safe Spline Surrogates for Large Point Clouds
To support real-time computation with large, possibly evolving point clouds and range data, we fit a trimmed uniform tensor-product spline function from one direction. The graph ...
Ashish Myles, Jörg Peters
163
Voted
DSRT
2006
IEEE
15 years 9 months ago
Speedup-Precision Tradeoffs in Time-Parallel Simulation of Wireless Ad hoc Networks
In this paper, we report on a series of experiments involving the speedups obtainable with time-parallel simulation of wireless ad hoc networks. A mobile ad hoc network scenario i...
Damla Turgut, Guoqiang Wang, Ladislau Böl&oum...