Sciweavers

13214 search results - page 2324 / 2643
» Pseudorandomness for network algorithms
Sort
View
PAKDD
2011
ACM
209views Data Mining» more  PAKDD 2011»
14 years 9 months ago
Spectral Analysis for Billion-Scale Graphs: Discoveries and Implementation
Abstract. Given a graph with billions of nodes and edges, how can we find patterns and anomalies? Are there nodes that participate in too many or too few triangles? Are there clos...
U. Kang, Brendan Meeder, Christos Faloutsos
PAMI
2011
14 years 9 months ago
Motion Field Estimation from Alternate Exposure Images
—Traditional optical flow algorithms rely on consecutive short-exposed images. In this work, we make use of an additional long-exposed image for motion field estimation. Long-e...
Anita Sellent, Martin Eisemann, Bastian Goldlü...
PRL
2011
14 years 9 months ago
Structural matching of 2D electrophoresis gels using deformed graphs
2D electrophoresis is a well known method for protein separation which is extremely useful in the field of proteomics. Each spot in the image represents a protein accumulation an...
Alexandre Noma, Alvaro Pardo, Roberto Marcondes Ce...
AAAI
2011
14 years 6 months ago
Relational Blocking for Causal Discovery
Blocking is a technique commonly used in manual statistical analysis to account for confounding variables. However, blocking is not currently used in automated learning algorithms...
Matthew J. Rattigan, Marc E. Maier, David Jensen
DAC
2011
ACM
14 years 6 months ago
Efficient incremental analysis of on-chip power grid via sparse approximation
In this paper, a new sparse approximation technique is proposed for incremental power grid analysis. Our proposed method is motivated by the observation that when a power grid net...
Pei Sun, Xin Li, Ming Yuan Ting
« Prev « First page 2324 / 2643 Last » Next »