Sciweavers

2479 search results - page 127 / 496
» Random Event Structures
Sort
View
BIBE
2006
IEEE
160views Bioinformatics» more  BIBE 2006»
15 years 7 months ago
Methods for Random Modularization of Biological Networks
— Biological networks are formalized summaries of our knowledge about interactions among biological system components, like genes, proteins, or metabolites. From their global top...
Zachary M. Saul, Vladimir Filkov
142
Voted
MSWIM
2006
ACM
15 years 7 months ago
The power of choice in random walks: an empirical study
In recent years different authors have proposed the used of random-walk-based algorithms for varying tasks in the networking community. These proposals include searching, routing...
Chen Avin, Bhaskar Krishnamachari
126
Voted
APPROX
2004
Springer
179views Algorithms» more  APPROX 2004»
15 years 6 months ago
Maximum Weight Independent Sets and Matchings in Sparse Random Graphs. Exact Results Using the Local Weak Convergence Method
ABSTRACT: Let G(n, c/n) and Gr(n) be an n-node sparse random graph and a sparse random rregular graph, respectively, and let I(n, r) and I(n, c) be the sizes of the largest indepen...
David Gamarnik, Tomasz Nowicki, Grzegorz Swirszcz
101
Voted
ICCV
2003
IEEE
16 years 3 months ago
Discriminative Random Fields: A Discriminative Framework for Contextual Interaction in Classification
In this work we present Discriminative Random Fields (DRFs), a discriminative framework for the classification of image regions by incorporating neighborhood interactions in the l...
Sanjiv Kumar, Martial Hebert
96
Voted
ALENEX
2007
105views Algorithms» more  ALENEX 2007»
15 years 2 months ago
ScrewBox: a Randomized Certifying Graph-Non-Isomorphism Algorithm
We present a novel randomized approach to the graph isomorphism problem. Our algorithm aims at solving difficult instances by producing randomized certificates for non-isomorphis...
Martin Kutz, Pascal Schweitzer