Sciweavers

7913 search results - page 470 / 1583
» Information Collection on a Graph
Sort
View
ICML
2008
IEEE
16 years 5 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 4 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
CIKM
2009
Springer
15 years 11 months ago
iPoG: fast interactive proximity querying on graphs
Given an author-conference graph, how do we answer proximity queries (e.g., what are the most related conferences for John Smith?); how can we tailor the search result if the user...
Hanghang Tong, Huiming Qu, Hani Jamjoom, Christos ...
COMPSAC
2008
IEEE
15 years 11 months ago
Measuring Network Security Using Bayesian Network-Based Attack Graphs
Given the increasing dependence of our societies on information systems, the overall security of these systems should be measured and improved. Existing work generally focuses on ...
Marcel Frigault, Lingyu Wang
ISMAR
2007
IEEE
15 years 11 months ago
Real-Time Object Tracking for Augmented Reality Combining Graph Cuts and Optical Flow
We present an efficient and accurate object tracking algorithm based on the concept of graph cut segmentation. The ability to track visible objects in real-time provides an inval...
Jonathan Mooser, Suya You, Ulrich Neumann