Sciweavers

401 search results - page 6 / 81
» Sparse Quasi-Random Graphs
Sort
View
TOG
2012
215views Communications» more  TOG 2012»
11 years 10 months ago
Videoscapes: exploring sparse, unstructured video collections
The abundance of mobile devices and digital cameras with video capture makes it easy to obtain large collections of video clips that contain the same location, environment, or eve...
James Tompkin, Kwang In Kim, Jan Kautz, Christian ...
IVS
2008
81views more  IVS 2008»
13 years 7 months ago
A dynamic multiscale magnifying tool for exploring large sparse graphs
We present an information visualization tool, known as GreenMax, to visually explore large small-world graphs with up to a million graph nodes on a desktop computer. A major motiv...
Pak Chung Wong, Harlan Foote, Patrick Mackey, Geor...
SODA
2012
ACM
205views Algorithms» more  SODA 2012»
11 years 10 months ago
Global minimum cuts in surface embedded graphs
We give a deterministic algorithm to find the minimum cut in a surface-embedded graph in near-linear time. Given an undirected graph embedded on an orientable surface of genus g,...
Jeff Erickson, Kyle Fox, Amir Nayyeri
ICASSP
2011
IEEE
12 years 11 months ago
Sparse graphical modeling of piecewise-stationary time series
Graphical models are useful for capturing interdependencies of statistical variables in various fields. Estimating parameters describing sparse graphical models of stationary mul...
Daniele Angelosante, Georgios B. Giannakis
TIT
2010
174views Education» more  TIT 2010»
13 years 2 months ago
Toeplitz Compressed Sensing Matrices With Applications to Sparse Channel Estimation
Compressed sensing (CS) has recently emerged as a powerful signal acquisition paradigm. In essence, CS enables the recovery of high-dimensional sparse signals from relatively few ...
Jarvis Haupt, Waheed Uz Zaman Bajwa, Gil M. Raz, R...