Sciweavers

2498 search results - page 211 / 500
» Algorithms for the Topological Watershed
Sort
View
COMPGEOM
2010
ACM
15 years 11 months ago
Approximating loops in a shortest homology basis from point data
Inference of topological and geometric attributes of a hidden manifold from its point data is a fundamental problem arising in many scientific studies and engineering application...
Tamal K. Dey, Jian Sun, Yusu Wang
ATAL
2008
Springer
15 years 8 months ago
Expediting RL by using graphical structures
The goal of Reinforcement learning (RL) is to maximize reward (minimize cost) in a Markov decision process (MDP) without knowing the underlying model a priori. RL algorithms tend ...
Peng Dai, Alexander L. Strehl, Judy Goldsmith
UAI
1996
15 years 8 months ago
An evaluation of structural parameters for probabilistic reasoning: Results on benchmark circuits
Many algorithms for processing probabilistic networks are dependent on the topological properties of the problem's structure. Such algorithmse.g., clustering, conditioning ar...
Yousri El Fattah, Rina Dechter
CGF
2000
155views more  CGF 2000»
15 years 6 months ago
Surface Reconstruction Based on Lower Dimensional Localized Delaunay Triangulation
We present a fast, memory efficient algorithm that generates a manifold triangular mesh S passing through a set of unorganized points P R3 . Nothing is assumed about the geometry,...
M. Gopi, Shankar Krishnan, Cláudio T. Silva
CORR
2008
Springer
116views Education» more  CORR 2008»
15 years 6 months ago
Polynomial Filtering for Fast Convergence in Distributed Consensus
Abstract--In the past few years, the problem of distributed consensus has received a lot of attention, particularly in the framework of ad hoc sensor networks. Most methods propose...
Effrosini Kokiopoulou, Pascal Frossard