Sciweavers

2531 search results - page 92 / 507
» Group testing in graphs
Sort
View
JCT
2006
54views more  JCT 2006»
15 years 4 months ago
Spectral estimates for Abelian Cayley graphs
We give two short proofs that for fixed d, a d-regular Cayley graph on an Abelian group of order n has second eigenvalue bounded below by d - O(dn-4/d), where the implied constant...
Joel Friedman, Ram Murty, Jean-Pierre Tillich
ICPR
2008
IEEE
15 years 10 months ago
Group-based meta-classification
Virtually all existing classification techniques label one sample at a time. In this paper, we highlight the potential benefits of group based classification (GBC), where the clas...
Noor Azah Samsudin, Andrew Bradley
LICS
2002
IEEE
15 years 9 months ago
Probabilistic Abstraction for Model Checking: An Approach Based on Property Testing
istic Abstraction for Model Checking: an Approach Based on Property Testing∗ Sophie Laplante† Richard Lassaigne‡ Fr´ed´eric Magniez§ Sylvain Peyronnet† Michel de Rougemo...
Sophie Laplante, Richard Lassaigne, Fréd&ea...
ICCV
2003
IEEE
16 years 6 months ago
Graph Partition by Swendsen-Wang Cuts
Vision tasks, such as segmentation, grouping, recognition, can be formulated as graph partition problems. The recent literature witnessed two popular graph cut algorithms: the Ncu...
Adrian Barbu, Song Chun Zhu
AEI
2008
108views more  AEI 2008»
15 years 4 months ago
Combinatorial synthesis approach employing graph networks
The paper proposes a methodology to assist the designer at the initial stages of the design synthesis process by enabling him/her to employ knowledge and algorithms existing in gr...
Offer Shai, Noel Titus, Karthik Ramani