Sciweavers

31 search results - page 5 / 7
» Sparse spectral factorization: Unicity and reconstruction al...
Sort
View
WDAG
2009
Springer
94views Algorithms» more  WDAG 2009»
13 years 11 months ago
Local Computation of Nearly Additive Spanners
Abstract. An (α, β)-spanner of a graph G is a subgraph H that approximates distances in G within a multiplicative factor α and an additive error β, ensuring that for any two no...
Bilel Derbel, Cyril Gavoille, David Peleg, Laurent...
ICPP
1995
IEEE
13 years 10 months ago
Multilevel Graph Partitioning Schemes
– In this paper we present experiments with a class of graph partitioning algorithms that reduce the size of the graph by collapsing vertices and edges, partition the smaller gra...
George Karypis, Vipin Kumar
CVPR
2011
IEEE
13 years 2 months ago
Noise Resistant Graph Ranking for Improved Web Image Search
In this paper, we exploit a novel ranking mechanism that processes query samples with noisy labels, motivated by the practical application of web image search re-ranking where the...
Wei Liu, Yu-Gang Jiang, Jiebo Luo, Shih-Fu Chang
NIPS
2007
13 years 8 months ago
People Tracking with the Laplacian Eigenmaps Latent Variable Model
Reliably recovering 3D human pose from monocular video requires models that bias the estimates towards typical human poses and motions. We construct priors for people tracking usi...
Zhengdong Lu, Miguel Á. Carreira-Perpi&ntil...
ICIAR
2004
Springer
14 years 2 days ago
A Fast Probabilistic Bidirectional Texture Function Model
The bidirectional texture function (BTF) describes rough texture appearance variations due to varying illumination and viewing conditions. Such a function consists of thousands of ...
Michal Haindl, Jirí Filip