2356 search results - page 99 / 472 » Characterizations of postman sets |
171
click to vote
PODC
2012
ACM
13 years 9 months ago
2012
ACM
In the Byzantine agreement problem, a set of n processors, any f of whom may be arbitrarily faulty, must reach agreement on a value proposed by one of the correct processors. It i...
189
click to vote
CVPR
2006
IEEE
16 years 8 months ago
2006
IEEE
We develop theory and algorithms to incorporate image manifold constraints in a level set segmentation algorithm. This provides a framework to simultaneously segment every image o...
200
click to vote
DM
2006
15 years 6 months ago
2006
For a chordal graph G = (V, E), we study the problem of whether a new vertex u V and a given set of edges between u and vertices in V can be added to G so that the resulting grap...
166
click to vote
TARK
2005
Springer
16 years 9 days ago
2005
Springer
Abstract This paper studies the interaction of error and information both in a single-person setting and in an interactive setting. In contrast to Blackwell’s Theorem, which says...
177
click to vote
IMAGING
2004
15 years 8 months ago
2004
Multispectral printer characterization requires an effective model to map printer input digital counts into reflectance spectra and vice versa. This paper presents a novel strateg...