Sciweavers

9405 search results - page 1419 / 1881
» Computing a Model of Set Theory
Sort
View
ICRA
2005
IEEE
102views Robotics» more  ICRA 2005»
16 years 15 days ago
Planning 3-D Path Networks in Unstructured Environments
Abstract— In this paper, we explore the problem of threedimensional motion planning in highly cluttered and unstructured outdoor environments. Because accurate sensing and modeli...
Nicolas Vandapel, James Kuffner, Omead Amidi
IV
2005
IEEE
149views Visualization» more  IV 2005»
16 years 14 days ago
Visualisation Techniques for Users and Designers of Layout Algorithms
Visualisation systems consisting of a set of components through which data and interaction commands flow have been explored by a number of researchers. Such hybrid and multistage ...
Greg Ross, Alistair Morrison, Matthew Chalmers
MINENET
2005
ACM
16 years 14 days ago
Shrink: a tool for failure diagnosis in IP networks
Faults in an IP network have various causes such as the failure of one or more routers at the IP layer, fiber-cuts, failure of physical elements at the optical layer, or extraneo...
Srikanth Kandula, Dina Katabi, Jean-Philippe Vasse...
SPAA
2005
ACM
16 years 13 days ago
Concurrent cache-oblivious b-trees
This paper presents concurrent cache-oblivious (CO) B-trees. We extend the cache-oblivious model to a parallel or distributed setting and present three concurrent CO B-trees. Our ...
Michael A. Bender, Jeremy T. Fineman, Seth Gilbert...
ISMIR
2005
Springer
154views Music» more  ISMIR 2005»
16 years 12 days ago
Exploiting the Tradeoff Between Precision and Cpu-Time to Speed Up Nearest Neighbor Search
We describe a recursive algorithm to quickly compute the N nearest neighbors according to a similarity measure in a metric space. The algorithm exploits an intrinsic property of a...
Pierre Roy, Jean-Julien Aucouturier, Franço...
« Prev « First page 1419 / 1881 Last » Next »