Sciweavers

2531 search results - page 103 / 507
» Group testing in graphs
Sort
View
122
Voted
BMCBI
2010
201views more  BMCBI 2010»
14 years 10 months ago
IntelliGO: a new vector-based semantic similarity measure including annotation origin
Background: The Gene Ontology (GO) is a well known controlled vocabulary describing the biological process, molecular function and cellular component aspects of gene annotation. I...
Sidahmed Benabderrahmane, Malika Smaïl-Tabbon...
CVPR
2005
IEEE
16 years 2 months ago
Spectral Segmentation with Multiscale Graph Decomposition
We present a multiscale spectral image segmentation algorithm. In contrast to most multiscale image processing, this algorithm works on multiple scales of the image in parallel, w...
Florence Bénézit, Jianbo Shi, Timoth...
117
Voted
KDD
2005
ACM
127views Data Mining» more  KDD 2005»
15 years 6 months ago
Mining closed relational graphs with connectivity constraints
Relational graphs are widely used in modeling large scale networks such as biological networks and social networks. In this kind of graph, connectivity becomes critical in identif...
Xifeng Yan, Xianghong Jasmine Zhou, Jiawei Han
105
Voted
COMBINATORICS
2004
90views more  COMBINATORICS 2004»
15 years 18 days ago
Goldberg-Coxeter Construction for 3- and 4-valent Plane Graphs
We consider the Goldberg-Coxeter construction GCk,l(G0) (a generalization of a simplicial subdivision of the dodecahedron considered in [Gold37] and [Cox71]), which produces a pla...
Mathieu Dutour, Michel Deza
ATS
2002
IEEE
108views Hardware» more  ATS 2002»
15 years 5 months ago
Fault Set Partition for Efficient Width Compression
In this paper, we present a technique for reducing the test length of counter-based pseudo-exhaustive built-in self-testing (BIST) based on width compression method. More formally...
Emil Gizdarski, Hideo Fujiwara