Sciweavers

321 search results - page 44 / 65
» Partitioning by iterative deletion
Sort
View
CCCG
2001
13 years 10 months ago
Nearest neighbor search through function minimization
This paper describes a solution to the nearest neighbor problem. The proposed algorithm, which makes use of the triangle inequality property, is considered from a function minimiz...
Chang Shu, Michael A. Greenspan, Guy Godin
IJCAI
2001
13 years 10 months ago
Symbolic Dynamic Programming for First-Order MDPs
We present a dynamic programming approach for the solution of first-order Markov decisions processes. This technique uses an MDP whose dynamics is represented in a variant of the ...
Craig Boutilier, Raymond Reiter, Bob Price
PAMI
2007
122views more  PAMI 2007»
13 years 8 months ago
Three-Dimensional Surface Mesh Segmentation Using Curvedness-Based Region Growing Approach
—A new parameter-free graph-morphology-based segmentation algorithm is proposed to address the problem of partitioning a 3D triangular mesh into disjoint submeshes that correspon...
Anupama Jagannathan, Eric L. Miller
ESWA
2010
158views more  ESWA 2010»
13 years 6 months ago
Interval competitive agglomeration clustering algorithm
1 In this study, a novel robust clustering algorithm, robust interval competitive agglomeration (RICA) clustering algorithm, is proposed to overcome the problems of the outliers, t...
Jin-Tsong Jeng, Chen-Chia Chuang, Chin-Wang Tao
ESOP
2011
Springer
13 years 18 days ago
Static Analysis of Run-Time Errors in Embedded Critical Parallel C Programs
We present a static analysis by Abstract Interpretation to check for run-time errors in parallel C programs. Following our work on Astr´ee, we focus on embedded critical programs ...
Antoine Miné