1949 search results - page 278 / 390 » Random graphs on surfaces |
126
Voted
SPAA
2004
ACM
15 years 9 months ago
2004
ACM
We study the problem of how resilient networks are to node faults. Specifically, we investigate the question of how many faults a network can sustain and still contain a large (i...
174
click to vote
LICS
2002
IEEE
15 years 9 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...
158
click to vote
SIGMETRICS
2008
ACM
15 years 4 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...
143
click to vote
JSAC
2011
14 years 11 months ago
2011
—Due to the potential of enhancing traffic safety, protecting environment, and enabling new applications, vehicular communications, especially vehicle-to-vehicle (V2V) communica...
146
click to vote
CVPR
2008
IEEE
16 years 6 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 ...