Sciweavers

274 search results - page 42 / 55
» Approximating Edit Distance Efficiently
Sort
View
IJRR
2007
104views more  IJRR 2007»
13 years 9 months ago
Deep Space Formation Flying Spacecraft Path Planning
Efficient algorithms for collision-free energy sub-optimal path planning for formations of spacecraft flying in deep space are presented. The idea is to introduce a set of way-poi...
Cornel Sultan, Sanjeev Seereeram, Raman K. Mehra
CORR
2010
Springer
143views Education» more  CORR 2010»
13 years 10 months ago
Opportunistic Routing in Ad Hoc Networks: How many relays should there be? What rate should nodes use?
Opportunistic routing is a multi-hop routing scheme which allows for selection of the best immediately available relay. In blind opportunistic routing protocols, where transmitters...
Joseph Blomer, Nihar Jindal
ICPR
2008
IEEE
14 years 11 months ago
A new approach to 3D shape recovery of local planar surface patches from shift-variant blurred images
A new approach is presented for 3D shape recovery of local planar surface patches from two shift/spacevariant defocused images. It is based on a recently proposed technique for in...
Murali Subbarao, Xue Tu, Youn-sik Kang
SIGGRAPH
1999
ACM
14 years 2 months ago
Tracing Ray Differentials
Antialiasing of ray traced images is typically performed by supersampling the image plane. While this type of filtering works well for many algorithms, it is much more efficient t...
Homan Igehy
NIPS
1998
13 years 11 months ago
Lazy Learning Meets the Recursive Least Squares Algorithm
Lazy learning is a memory-based technique that, once a query is received, extracts a prediction interpolating locally the neighboring examples of the query which are considered re...
Mauro Birattari, Gianluca Bontempi, Hugues Bersini