Sciweavers

552 search results - page 6 / 111
» Observable Graphs
Sort
View
SDM
2009
SIAM
118views Data Mining» more  SDM 2009»
14 years 6 months ago
Finding Links and Initiators: A Graph-Reconstruction Problem.
Consider a 0–1 observation matrix M, where rows correspond to entities and columns correspond to signals; a value of 1 (or 0) in cell (i, j) of M indicates that signal j has bee...
Evimaria Terzi, Heikki Mannila
CPC
2006
92views more  CPC 2006»
13 years 9 months ago
Waiting for a Bat to Fly By (in Polynomial Time)
We observe returns of a simple random walk on a finite graph to a fixed node, and would like to infer properties of the graph, in particular properties of the spectrum of the trans...
Itai Benjamini, Gady Kozma, László L...
ACIVS
2007
Springer
14 years 3 months ago
Joint Tracking and Segmentation of Objects Using Graph Cuts
This paper presents a new method to both track and segment objects in videos. It includes predictions and observations inside an energy function that is minimized with graph cuts. ...
Aurélie Bugeau, Patrick Pérez
INFOCOM
2012
IEEE
11 years 11 months ago
Sampling directed graphs with random walks
Abstract—Despite recent efforts to characterize complex networks such as citation graphs or online social networks (OSNs), little attention has been given to developing tools tha...
Bruno F. Ribeiro, Pinghui Wang, Fabricio Murai, Do...
ICDM
2008
IEEE
117views Data Mining» more  ICDM 2008»
14 years 3 months ago
RTM: Laws and a Recursive Generator for Weighted Time-Evolving Graphs
How do real, weighted graphs change over time? What patterns, if any, do they obey? Earlier studies focus on unweighted graphs, and, with few exceptions, they focus on static snap...
Leman Akoglu, Mary McGlohon, Christos Faloutsos