5344 search results - page 401 / 1069 » Privacy-Preserving Set Operations |
127
click to vote
SGP
2003
15 years 6 months ago
2003
In this paper we present a novel algorithm for reconstructing 3D scenes from a set of images. The user defines a set of polygonal regions with corresponding labels in each image ...
130
click to vote
AAMAS
2010
Springer
15 years 5 months ago
2010
Springer
This paper investigates cooperative search strategies for agents engaged in costly search in a complex environment. Searching cooperatively, several search goals can be satisfied w...
142
click to vote
ACTA
2010
15 years 5 months ago
2010
This paper describes an effective verification procedure for imperative programs that handle (balanced) tree-like data structures. Since the verification problem considered is unde...
154
click to vote
CORR
2006
Springer
15 years 5 months ago
2006
Springer
Assuming iterative decoding for binary erasure channels (BECs), a novel tree-based technique for upper bounding the bit error rates (BERs) of arbitrary, finite low-density parity-c...
129
click to vote
FMSD
2006
15 years 5 months ago
2006
Convex polyhedra are often used to approximate sets of states of programs involving numerical variables. The manipulation of convex polyhedra relies on the so-called double descri...