Sciweavers

164 search results - page 30 / 33
» Adaptive Algorithms for Planar Convex Hull Problems
Sort
View
CORR
2010
Springer
92views Education» more  CORR 2010»
13 years 7 months ago
Exact counting of Euler Tours for generalized series-parallel graphs
We give a simple polynomial-time algorithm to exactly count the number of Euler Tours (ETs) of any Eulerian generalized series-parallel graph, and show how to adapt this algorithm...
Prasad Chebolu, Mary Cryan, Russell A. Martin
MOBIHOC
2005
ACM
14 years 7 months ago
Localization and routing in sensor networks by local angle information
Location information is very useful in the design of sensor network infrastructures. In this paper, we study the anchor-free 2D localization problem by using local angle measureme...
Jehoshua Bruck, Jie Gao, Anxiao Jiang
CAD
2000
Springer
13 years 7 months ago
Time-critical multiresolution rendering of large complex models
Very large and geometrically complex scenes, exceeding millions of polygons and hundreds of objects, arise naturally in many areas of interactive computer graphics. Time-critical ...
Enrico Gobbetti, Eric Bouvier
ICML
2010
IEEE
13 years 8 months ago
Inverse Optimal Control with Linearly-Solvable MDPs
We present new algorithms for inverse optimal control (or inverse reinforcement learning, IRL) within the framework of linearlysolvable MDPs (LMDPs). Unlike most prior IRL algorit...
Dvijotham Krishnamurthy, Emanuel Todorov
CGF
2007
157views more  CGF 2007»
13 years 7 months ago
Mesh Segmentation via Spectral Embedding and Contour Analysis
We propose a mesh segmentation algorithm via recursive bisection where at each step, a sub-mesh embedded in 3D is first spectrally projected into the plane and then a contour is ...
Rong Liu, Hao Zhang 0002