Sciweavers

336 search results - page 24 / 68
» Effective Randomness for Computable Probability Measures
Sort
View
CORR
2010
Springer
94views Education» more  CORR 2010»
13 years 4 months ago
The Stability of Low-Rank Matrix Reconstruction: a Constrained Singular Value View
The stability of low-rank matrix reconstruction is investigated in this paper. The -constrained minimal singular value ( -CMSV) of the measurement operator is shown to determine t...
Gongguo Tang, Arye Nehorai
CVPR
2009
IEEE
1148views Computer Vision» more  CVPR 2009»
15 years 2 months ago
Shape Constrained Figure-Ground Segmentation and Tracking
Global shape information is an effective top-down complement to bottom-up figure-ground segmentation as well as a useful constraint to avoid drift during adaptive tracking. We p...
Zhaozheng Yin, Robert T. Collins
KDD
2007
ACM
144views Data Mining» more  KDD 2007»
14 years 8 months ago
Fast direction-aware proximity for graph mining
In this paper we study asymmetric proximity measures on directed graphs, which quantify the relationships between two nodes or two groups of nodes. The measures are useful in seve...
Hanghang Tong, Christos Faloutsos, Yehuda Koren
ASPDAC
2010
ACM
135views Hardware» more  ASPDAC 2010»
13 years 5 months ago
Statistical timing verification for transparently latched circuits through structural graph traversal
Level-sensitive transparent latches are widely used in high-performance sequential circuit designs. Under process variations, the timing of a transparently latched circuit will ada...
Xingliang Yuan, Jia Wang
ICML
2008
IEEE
14 years 8 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