2531 search results - page 110 / 507 » Group testing in graphs |
109
click to vote
ICPP
2006
IEEE
15 years 6 months ago
2006
IEEE
stractions are extensively used to understand and solve challenging computational problems in various scientific and engineering domains. They have particularly gained prominence...
118
click to vote
ECEASST
2006
15 years 24 days ago
2006
Mining for frequent subgraphs in a graph database has become a popular topic in the last years. Algorithms to solve this problem are used in chemoinformatics to find common molecul...
119
Voted
IBIS
2006
15 years 24 days ago
2006
: Schema matching is the task of finding semantic correspondences between elements of two schemas, which plays a key role in many database applications. In this paper, we cast the ...
116
click to vote
CVPR
2012
IEEE
13 years 3 months ago
2012
IEEE
Grouping cues can affect the performance of segmentation greatly. In this paper, we show that superpixels (image segments) can provide powerful grouping cues to guide segmentation...
115
Voted
STOC
2006
ACM
16 years 1 months ago
2006
ACM
Gowers [Gow98, Gow01] introduced, for d 1, the notion of dimension-d uniformity Ud (f) of a function f : G C, where G is a finite abelian group. Roughly speaking, if a function ...