Sciweavers

199 search results - page 16 / 40
» Approximating Center Points with Iterated Radon Points
Sort
View
IPMI
2007
Springer
14 years 8 months ago
Probabilistic Clustering and Quantitative Analysis of White Matter Fiber Tracts
A novel framework for joint clustering and point-by-point mapping of white matter fiber pathways is presented. Accurate clustering of the trajectories into fiber bundles requires p...
Mahnaz Maddah, William M. Wells III, Simon K. Warf...
ICASSP
2010
IEEE
13 years 7 months ago
Iterated smoothing for accelerated gradient convex minimization in signal processing
In this paper, we consider the problem of minimizing a non-smooth convex problem using first-order methods. The number of iterations required to guarantee a certain accuracy for ...
Tobias Lindstrøm Jensen, Jan Østerga...
ICMCS
2009
IEEE
215views Multimedia» more  ICMCS 2009»
13 years 5 months ago
Image trimming via saliency region detection and iterative feature matching
Detection of saliency regions in images is useful for object based image understanding and object localization. In our work, we investigate a saliency region detection algorithm b...
Jiawei Huang, Ze-Nian Li
PODS
2008
ACM
159views Database» more  PODS 2008»
14 years 7 months ago
Approximation algorithms for clustering uncertain data
There is an increasing quantity of data with uncertainty arising from applications such as sensor network measurements, record linkage, and as output of mining algorithms. This un...
Graham Cormode, Andrew McGregor
APPROX
2006
Springer
234views Algorithms» more  APPROX 2006»
13 years 11 months ago
Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs
For a given graph with weighted vertices, the goal of the minimum-weight dominating set problem is to compute a vertex subset of smallest weight such that each vertex of the graph...
Christoph Ambühl, Thomas Erlebach, Matú...