Sciweavers

3708 search results - page 171 / 742
» Approximating Betweenness Centrality
Sort
View
SODA
2012
ACM
185views Algorithms» more  SODA 2012»
13 years 7 months ago
On a linear program for minimum-weight triangulation
ABSTRACT∗ Arman Yousefi† Neal E. Young‡ Minimum-weight triangulation (MWT) is NP-hard. It has a polynomial-time constant-factor approximation algorithm, and a variety of e...
Arman Yousefi, Neal E. Young
TKDE
2010
195views more  TKDE 2010»
15 years 3 months ago
Query Processing Using Distance Oracles for Spatial Networks
—The popularity of location-based services and the need to do real-time processing on them has led to an interest in performing queries on transportation networks, such as findin...
Jagan Sankaranarayanan, Hanan Samet
WIRN
2005
Springer
15 years 10 months ago
Ensembles Based on Random Projections to Improve the Accuracy of Clustering Algorithms
We present an algorithmic scheme for unsupervised cluster ensembles, based on randomized projections between metric spaces, by which a substantial dimensionality reduction is obtai...
Alberto Bertoni, Giorgio Valentini
CVPR
2007
IEEE
16 years 7 months ago
On the Direct Estimation of the Fundamental Matrix
The fundamental matrix is a central construct in the analysis of images captured from a pair of cameras and many feature-based methods have been proposed for its computation. In t...
Yaser Sheikh, Asaad Hakeem, Mubarak Shah
CVPR
2008
IEEE
16 years 7 months ago
Color constancy beyond bags of pixels
Estimating the color of a scene illuminant often plays a central role in computational color constancy. While this problem has received significant attention, the methods that exi...
Ayan Chakrabarti, Keigo Hirakawa, Todd Zickler