Sciweavers

2004 search results - page 242 / 401
» Sampling from large graphs
Sort
View
134
Voted
VLDB
2004
ACM
120views Database» more  VLDB 2004»
15 years 8 months ago
Relational link-based ranking
Link analysis methods show that the interconnections between web pages have lots of valuable information. The link analysis methods are, however, inherently oriented towards analy...
Floris Geerts, Heikki Mannila, Evimaria Terzi
ICALP
2010
Springer
15 years 8 months ago
Additive Spanners in Nearly Quadratic Time
We consider the problem of efficiently finding an additive C-spanner of an undirected unweighted graph G, that is, a subgraph H so that for all pairs of vertices u, v, δH (u, v) ...
David P. Woodruff
126
Voted
CN
2008
98views more  CN 2008»
15 years 3 months ago
Description and simulation of dynamic mobility networks
During the last decade, the study of large scale complex networks has attracted a substantial amount of attention and works from several domains: sociology, biology, computer scie...
Antoine Scherrer, Pierre Borgnat, Eric Fleury, Jea...
131
Voted
CVPR
2006
IEEE
16 years 5 months ago
Shape Topics: A Compact Representation and New Algorithms for 3D Partial Shape Retrieval
This paper develops an efficient new method for 3D partial shape retrieval. First, a Monte Carlo sampling strategy is employed to extract local shape signatures from each 3D model...
Yi Liu, Hongbin Zha, Hong Qin
138
Voted
ECCV
2004
Springer
16 years 5 months ago
Appearance Based Qualitative Image Description for Object Class Recognition
The problem of recognizing classes of objects as opposed to special instances requires methods of comparing images that capture the variation within the class while they discrimina...
Johan Thureson, Stefan Carlsson