Sciweavers

75 search results - page 8 / 15
» Triangle Fixing Algorithms for the Metric Nearness Problem
Sort
View
STOC
2003
ACM
102views Algorithms» more  STOC 2003»
14 years 9 months ago
On metric ramsey-type phenomena
The main question studied in this article may be viewed as a nonlinear analogue of Dvoretzky's theorem in Banach space theory or as part of Ramsey theory in combinatorics. Gi...
Yair Bartal, Nathan Linial, Manor Mendel, Assaf Na...
ICALP
2009
Springer
14 years 9 months ago
Correlation Clustering Revisited: The "True" Cost of Error Minimization Problems
Correlation Clustering was defined by Bansal, Blum, and Chawla as the problem of clustering a set of elements based on a possibly inconsistent binary similarity function between e...
Nir Ailon, Edo Liberty
HPCC
2005
Springer
14 years 2 months ago
A Coarse Grained Parallel Algorithm for Closest Larger Ancestors in Trees with Applications to Single Link Clustering
Hierarchical clustering methods are important in many data mining and pattern recognition tasks. In this paper we present an efficient coarse grained parallel algorithm for Single...
Albert Chan, Chunmei Gao, Andrew Rau-Chaplin
ECCV
2008
Springer
14 years 10 months ago
Anisotropic Geodesics for Perceptual Grouping and Domain Meshing
This paper shows how computational Riemannian manifold can be used to solve several problems in computer vision and graphics. Indeed, Voronoi segmentations and Delaunay graphs comp...
Sébastien Bougleux, Gabriel Peyré, L...
ECRTS
1998
IEEE
14 years 26 days ago
Using exact feasibility tests for allocating real-time tasks in multiprocessor systems
This paper introduces improvements in partitioning schemes for multiprocessor real-time systems which allow higher processor utilization and enhanced schedulability by using exact...
Sergio Saez, Joan Vila i Carbó, Alfons Cres...