Sciweavers

999 search results - page 122 / 200
» Finding shapes in a set of points
Sort
View
TMI
2010
134views more  TMI 2010»
14 years 4 months ago
Mitral Annulus Segmentation From 3D Ultrasound Using Graph Cuts
The shape of the mitral valve annulus is used in diagnostic and modeling applications, yet methods to accurately and reproducibly delineate the annulus are limited. This paper pres...
Robert Schneider, Douglas P. Perrin, Nikolay V. Va...
AI
2008
Springer
14 years 10 months ago
Alternating-offers bargaining with one-sided uncertain deadlines: an efficient algorithm
In the arena of automated negotiations we focus on the principal negotiation protocol in bilateral settings, i.e. the alternatingoffers protocol. In the scientific community it is...
Nicola Gatti, Francesco Di Giunta, Stefano Marino
ICDE
1999
IEEE
183views Database» more  ICDE 1999»
15 years 11 months ago
ROCK: A Robust Clustering Algorithm for Categorical Attributes
Clustering, in data mining, is useful to discover distribution patterns in the underlying data. Clustering algorithms usually employ a distance metric based (e.g., euclidean) simi...
Sudipto Guha, Rajeev Rastogi, Kyuseok Shim
MMM
2005
Springer
172views Multimedia» more  MMM 2005»
15 years 3 months ago
A Novel Approach of 3D Reconstruction of Human Face Using Monocular Camera
Three-dimensional model acquisition of an object is essential in many multimedia applications. Constructing three-dimensional models of objects from two-dimensional images is an o...
Ben Yip, Jesse S. Jin
ASPDAC
2001
ACM
103views Hardware» more  ASPDAC 2001»
15 years 1 months ago
Efficient minimum spanning tree construction without Delaunay triangulation
Given n points in a plane, a minimum spanning tree is a set of edges which connects all the points and has a minimum total length. A naive approach enumerates edges on all pairs o...
Hai Zhou, Narendra V. Shenoy, William Nicholls