6881 search results - page 1194 / 1377 » Motivation |
184
click to vote
CIAC
2006
Springer
15 years 10 months ago
2006
Springer
The network discovery (verification) problem asks for a minimum subset Q V of queries in an undirected graph G = (V, E) such that these queries discover all edges and non-edges o...
223
click to vote
ESAS
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. The fact that security is a critical problem when implementing mobile ad hoc networks (MANETs) is widely acknowledged. One of the different kinds of misbehavior a node ma...
226
click to vote
ETRA
2004
ACM
15 years 10 months ago
2004
ACM
This paper evaluates the use of Visual Deictic Reference (VDR) in Collaborative Virtual Environments (CVEs). A simple CVE capable of hosting two (or more) participants simultaneou...
144
click to vote
COCO
2006
Springer
15 years 10 months ago
2006
Springer
We consider the problem of finding a monomial (or a term) that maximizes the agreement rate with a given set of examples over the Boolean hypercube. The problem is motivated by le...
190
click to vote
CRYPTO
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Let A and B denote cryptographic primitives. A (k, m)robust A-to-B combiner is a construction, which takes m implementations of primitive A as input, and yields an implem...