Sciweavers

5128 search results - page 1002 / 1026
» When Abstraction Fails
Sort
View
SIAMAM
2000
128views more  SIAMAM 2000»
13 years 10 months ago
Advection-Diffusion Equations for Internal State-Mediated Random Walks
Abstract. In many biological examples of biased random walks, movement statistics are determined by state dynamics that are internal to the organism or cell and that mediate respon...
Daniel Grünbaum
APIN
1998
107views more  APIN 1998»
13 years 10 months ago
Multiple Adaptive Agents for Tactical Driving
Abstract. Recent research in automated highway systems has ranged from low-level vision-based controllers to high-level route-guidance software. However, there is currently no syst...
Rahul Sukthankar, Shumeet Baluja, John Hancock
ALGORITHMICA
1999
141views more  ALGORITHMICA 1999»
13 years 10 months ago
Design and Implementation of a Practical Parallel Delaunay Algorithm
Abstract. This paper describes the design and implementation of a practical parallel algorithm for Delaunay triangulation that works well on general distributions. Although there h...
Guy E. Blelloch, Jonathan C. Hardwick, Gary L. Mil...
DTJ
1998
171views more  DTJ 1998»
13 years 10 months ago
Measurement and Analysis of C and C++ Performance
ir increasing use of abstraction, modularity, delayed binding, polymorphism, and source reuse, especially when these attributes are used in combination. Modern processor architectu...
Hemant G. Rotithor, Kevin W. Harris, Mark W. Davis
CORR
1999
Springer
222views Education» more  CORR 1999»
13 years 10 months ago
Analysis of approximate nearest neighbor searching with clustered point sets
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
Songrit Maneewongvatana, David M. Mount
« Prev « First page 1002 / 1026 Last » Next »