575 search results - page 14 / 115 » A Note on Karr's Algorithm |
TCS
2008
13 years 7 months ago
2008
Reporting the maximal cliques of a graph is a fundamental problem arising in many areas. This note bridges the gap between three papers addressing this problem: the original paper...
COMBINATORICS
2000
13 years 7 months ago
2000
It is shown in this note that with high probability it is enough to destroy all triangles in order to get a cover graph from a random graph Gn,p with p log n/n for any constant ...
ICPR
2002
IEEE
14 years 8 months ago
2002
IEEE
We provide elementary geometric arguments to show that the principal point of cameras with small to moderate field of view cannot be reliably estimated from natural, noisy images ...
DAGSTUHL
2008
13 years 8 months ago
2008
Techniques of reliable computing, like interval arithmetic, can be used to guarantee reliable solutions even in the presence of numerical round-off errors. The need to trace bounds...
COMBINATORICS
2006
13 years 7 months ago
2006
We present a variation of James Propp's generalized domino shuffling, which provides an efficient way to obtain perfect matchings of weighted Aztec diamonds. Our modification...