Sciweavers

2479 search results - page 95 / 496
» Random Event Structures
Sort
View
CORR
2011
Springer
168views Education» more  CORR 2011»
13 years 14 days ago
Robustness and modular structure in networks
Many complex systems, from power grids and the internet, to the brain and society, can be modeled using modular networks. Modules, densely interconnected groups of elements, often...
James P. Bagrow, Sune Lehmann, Yong-Yeol Ahn
TIP
2008
124views more  TIP 2008»
13 years 8 months ago
Graph Laplacian Tomography From Unknown Random Projections
We introduce a graph Laplacian based algorithm for the tomography reconstruction of a planar object from its projections taken at random unknown directions. The algorithm is shown ...
Ronald R. Coifman, Yoel Shkolnisky, Fred J. Sigwor...
ISCI
2010
134views more  ISCI 2010»
13 years 7 months ago
Cascade Markov random fields for stroke extraction of Chinese characters
Extracting perceptually meaningful strokes plays an essential role in modeling structures of handwritten Chinese characters for accurate character recognition. This paper proposes...
Jia Zeng, Wei Feng, Lei Xie, Zhi-Qiang Liu
KDD
1998
ACM
193views Data Mining» more  KDD 1998»
14 years 1 months ago
Methods for Linking and Mining Massive Heterogeneous Databases
Manyreal-world KDDexpeditions involve investigation of relationships betweenvariables in different, heterogeneousdatabases. Wepresent a dynamic programmingtechnique for linking re...
José C. Pinheiro, Don X. Sun
STOC
2003
ACM
188views Algorithms» more  STOC 2003»
14 years 9 months ago
Almost random graphs with simple hash functions
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
Martin Dietzfelbinger, Philipp Woelfel