1439 search results - page 141 / 288 » Fast approximation of centrality |
127
click to vote
ICCV
2011
IEEE
14 years 24 days ago
2011
IEEE
This paper addresses the problem of category-level image classification. The underlying image model is a graph whose nodes correspond to a dense set of regions, and edges reflec...
128
Voted
CVPR
2010
IEEE
15 years 8 months ago
2010
IEEE
Searching approximate nearest neighbors in large scale high dimensional data set has been a challenging problem. This paper presents a novel and fast algorithm for learning binary...
GD
2004
Springer
15 years 6 months ago
2004
Springer
It has been noted that many realistic graphs have a power law degree distribution and exhibit the small world phenomenon. We present drawing methods influenced by recent developm...
ICRA
2000
IEEE
15 years 5 months ago
2000
IEEE
This paper describes a fast technique for modifying motion sequences for complex articulated mechanisms in a way that preserves physical properties of the motion. This technique i...
109
Voted
SPIRE
1998
Springer
15 years 5 months ago
1998
Springer
We present a fast compression and decompression technique for natural language texts. The novelty is that the exact search can be done on the compressed text directly, using any k...