67 search results - page 9 / 14 » Complexity Results on Graphs with Few Cliques |
IRI
2007
IEEE
14 years 1 months ago
2007
IEEE
Suppose we are given a set A of activities of interest, a set O of observations, and a probability threshold p. We are interested in finding the set of all pairs (a, O ), where a...
CVPR
1999
IEEE
14 years 9 months ago
1999
IEEE
We present a stochastic clustering algorithm which uses pairwise similarity of elements, based on a new graph theoretical algorithm for the sampling of cuts in graphs. The stochas...
SMA
2009
ACM
14 years 2 months ago
2009
ACM
We examine the problem of computing exactly the Delaunay graph (and the dual Voronoi diagram) of a set of, possibly intersecting, smooth convex pseudo-circles in the Euclidean pla...
STOC
2006
ACM
14 years 7 months ago
2006
ACM
We consider the problem of randomness extraction from independent sources. We construct an extractor that can extract from a constant number of independent sources of length n, ea...
DSD
2006
IEEE
14 years 1 months ago
2006
IEEE
The rising complexity, customization and short time to market of modern digital systems requires automatic methods for generation of high performance architectures for such system...