Sciweavers

667 search results - page 35 / 134
» Computably Based Locally Compact Spaces
Sort
View
SIAMCOMP
2008
72views more  SIAMCOMP 2008»
13 years 7 months ago
Plottable Real Number Functions and the Computable Graph Theorem
The Graph Theorem of classical recursion theory states that a total function on the natural numbers is computable, if and only if its graph is recursive. It is known that this res...
Vasco Brattka
MOBIHOC
2005
ACM
14 years 7 months ago
Sextant: a unified node and event localization framework using non-convex constraints
Determining node and event locations is a canonical task for many wireless network applications. Yet dedicated infrastructure for determining position information is expensive, en...
Emin Gün Sirer, Rohan Murty, Saikat Guha
MOBICOM
2010
ACM
13 years 8 months ago
The spaces between us: setting and maintaining boundaries in wireless spectrum access
Guardbands are designed to insulate transmissions on adjacent frequencies from mutual interference. As more devices in a given area are packed into orthogonal wireless channels, c...
Lei Yang, Ben Y. Zhao, Haitao Zheng
ICRA
2005
IEEE
135views Robotics» more  ICRA 2005»
14 years 1 months ago
Sampling-Based Motion Planning Using Predictive Models
— Robotic motion planning requires configuration space exploration. In high-dimensional configuration spaces, a complete exploration is computationally intractable. Practical m...
Brendan Burns, Oliver Brock

Publication
1147views
15 years 6 months ago
PDE-based fast local level set method
We develop a fast method to localize the level set method of Osher and Sethian (1988, Journal of Computational Physics) and address two important issues that are intrinsic to the l...
Danping Peng, Barry Merriman, Stanley Osher, Hongk...