Sciweavers

120 search results - page 22 / 24
» On locally Delaunay geometric graphs
Sort
View
FTTCS
2006
132views more  FTTCS 2006»
13 years 8 months ago
Algorithms and Data Structures for External Memory
Data sets in large applications are often too massive to fit completely inside the computer's internal memory. The resulting input/output communication (or I/O) between fast ...
Jeffrey Scott Vitter
IJRR
2008
80views more  IJRR 2008»
13 years 8 months ago
Motion Planning for Legged Robots on Varied Terrain
This paper studies the quasi-static motion of large legged robots that have many degrees of freedom. While gaited walking may suffice on easy ground, rough and steep terrain requi...
Kris K. Hauser, Timothy Bretl, Jean-Claude Latombe...
RAS
2007
113views more  RAS 2007»
13 years 8 months ago
From images to rooms
In this paper we start from a set of images obtained by the robot that is moving around in an environment. We present a method to automatically group the images into groups that c...
Zoran Zivkovic, Olaf Booij, Ben J. A. Kröse
SIGGRAPH
1997
ACM
14 years 21 days ago
Metropolis light transport
We present a new Monte Carlo method for solving the light transport problem, inspired by the Metropolis sampling method in computational physics. To render an image, we generate a...
Eric Veach, Leonidas J. Guibas
SIGMETRICS
2006
ACM
14 years 2 months ago
Robust network connectivity: when it's the big picture that matters
This work analyzes the connectivity of large diameter networks where every link has an independent probability p of failure. We give a (relatively simple) topological condition th...
Enoch Peserico, Larry Rudolph