1208 search results - page 31 / 242 » On Counting Generalized Colorings |
CVPR
2006
IEEE
14 years 9 months ago
2006
IEEE
In its full generality, motion analysis of crowded objects necessitates recognition and segmentation of each moving entity. The difficulty of these tasks increases considerably wi...
APPROX
2004
Springer
14 years 1 months ago
2004
Springer
While it is exponentially unlikely that a sparse random graph or hypergraph is connected, with probability 1 − o(1) such a graph has a “giant component” that, given its numbe...
ICFP
2010
ACM
13 years 9 months ago
2010
ACM
We show how the binary encoding and decoding of typed data and typed programs can be understood, programmed, and verified with the help of question-answer games. The encoding of a...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Tree-based protocols are ubiquitous in distributed systems. They are flexible, they perform generally well, and, in static conditions, their analysis is mostly simple. Under churn...
SIGIR
2002
ACM
13 years 7 months ago
2002
ACM
Most test collections (like TREC and CLEF) for experimental research in information retrieval apply binary relevance assessments. This paper introduces a four-point relevance scal...