1542 search results - page 232 / 309 » The metamathematics of random graphs |
147
click to vote
LICS
2002
IEEE
15 years 6 months ago
2002
IEEE
istic Abstraction for Model Checking: an Approach Based on Property Testing∗ Sophie Laplante† Richard Lassaigne‡ Fr´ed´eric Magniez§ Sylvain Peyronnet† Michel de Rougemo...
133
click to vote
SIGMETRICS
2008
ACM
15 years 1 months ago
2008
ACM
Fine-grained network measurement requires routers and switches to update large arrays of counters at very high link speed (e.g. 40 Gbps). A naive algorithm needs an infeasible amo...
119
click to vote
CVPR
2008
IEEE
16 years 3 months ago
2008
IEEE
We present a random field based model for stereo vision with explicit occlusion labeling in a probabilistic framework. The model employs non-parametric cost functions that can be ...
200
click to vote
ICDE
2006
IEEE
16 years 3 months ago
2006
IEEE
Peer-to-peer databases are becoming prevalent on the Internet for distribution and sharing of documents, applications, and other digital media. The problem of answering large scal...
WALCOM
2010
IEEE
15 years 8 months ago
2010
IEEE
We address a version of the set-cover problem where we do not know the sets initially (and hence referred to as covert) but we can query an element to find out which sets contain ...