1591 search results - page 225 / 319 » Random lifts of graphs |
115
click to vote
WALCOM
2010
IEEE
15 years 11 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 ...
124
click to vote
ICC
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract—This paper studies probabilistic information dissemination in random networks. Consider the following scenario: A node intends to deliver a message to all other nodes in...
129
click to vote
ICRA
2000
IEEE
15 years 8 months ago
2000
IEEE
This paper presents a randomized motion planner for kinodynamic asteroidavoidanceproblems, in which a robot must avoid collision with moving obstacles under kinematic, dynamic con...
133
click to vote
CRYPTO
2006
Springer
15 years 8 months ago
2006
Springer
In this paper we formalize a general model of cryptanalytic time/memory tradeoffs for the inversion of a random function f : {0, 1, . . . , N - 1} {0, 1, . . . , N - 1}. The model...
141
click to vote
CIVR
2010
Springer
15 years 6 months ago
2010
Springer
Most existing reranking approaches to image search focus solely on mining "visual" cues within the initial search results. However, the visual information cannot always ...