Sciweavers

3708 search results - page 488 / 742
» Approximating Betweenness Centrality
Sort
View
COMGEO
2008
ACM
15 years 6 months ago
Optimal location of transportation devices
We consider algorithms for finding the optimal location of a simple transportation device, that we call a moving walkway, consisting of a pair of points in the plane between which ...
Jean Cardinal, Sébastien Collette, Ferran H...
BMCBI
2006
118views more  BMCBI 2006»
15 years 6 months ago
Microarray image analysis: background estimation using quantile and morphological filters
Background: In a microarray experiment the difference in expression between genes on the same slide is up to 103 fold or more. At low expression, even a small error in the estimat...
Anders Bengtsson, Henrik Bengtsson
CVPR
2003
IEEE
16 years 8 months ago
Visual Hull Alignment and Refinement Across Time: A 3D Reconstruction Algorithm Combining Shape-From-Silhouette with Stereo
Visual Hull (VH) construction from silhouette images is a popular method of shape estimation. The method, also known as Shape-From-Silhouette (SFS), is used in many applications s...
German K. M. Cheung, Simon Baker, Takeo Kanade
STOC
2005
ACM
130views Algorithms» more  STOC 2005»
16 years 7 months ago
Low-distortion embeddings of general metrics into the line
A low-distortion embedding between two metric spaces is a mapping which preserves the distances between each pair of points, up to a small factor called distortion. Low-distortion...
Mihai Badoiu, Julia Chuzhoy, Piotr Indyk, Anastasi...
ICALP
2009
Springer
16 years 7 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