Sciweavers

1538 search results - page 125 / 308
» Spectral Techniques in Graph Algorithms
Sort
View
ICML
2008
IEEE
16 years 2 months ago
Fast incremental proximity search in large graphs
In this paper we investigate two aspects of ranking problems on large graphs. First, we augment the deterministic pruning algorithm in Sarkar and Moore (2007) with sampling techni...
Purnamrita Sarkar, Andrew W. Moore, Amit Prakash
ICDE
2010
IEEE
260views Database» more  ICDE 2010»
16 years 1 months ago
Anonymizing Weighted Social Network Graphs
The increasing popularity of social networks has initiated a fertile research area in information extraction and data mining. Although such analysis can facilitate better understan...
Sudipto Das, Ömer Egecioglu, Amr El Abbadi
TVCG
2008
138views more  TVCG 2008»
15 years 1 months ago
Real-Time Path Planning in Dynamic Virtual Environments Using Multiagent Navigation Graphs
We present a novel approach for efficient path planning and navigation of multiple virtual agents in complex dynamic scenes. We introduce a new data structure, Multiagent Navigatio...
Avneesh Sud, Erik Andersen, Sean Curtis, Ming C. L...
IC
2003
15 years 2 months ago
Metasearch Via the Co-Citation Graph
—In spite of numerous search engines available on the web, no single engine is capable of performing “better” under all circumstances. This being the case, metasearch engines...
Hyun-Chul Lee
131
Voted
ICIP
2009
IEEE
14 years 11 months ago
Optical flow and depth from motion for omnidirectional images using a TV-L1 variational framework on graphs
This paper deals with the problem of efficiently computing the optical flow of image sequences acquired by omnidirectional (nearly full field of view) cameras. We formulate the pr...
Luigi Bagnato, Pascal Frossard, Pierre Vandergheyn...