4313 search results - page 342 / 863 » Using time travel to diagnose computer problems |
224
click to vote
SPAA
1993
ACM
15 years 11 months ago
1993
ACM
We give tight bounds on the parallel complexity of some problems involving random graphs. Speci cally, we show that a Hamiltonian cycle, a breadth rst spanning tree, and a maximal...
365
click to vote
STOC
2003
ACM
16 years 7 months ago
2003
ACM
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...
190
click to vote
ACNS
2005
Springer
16 years 1 months ago
2005
Springer
Recently, several public key exchange protocols based on symbolic computation in non-commutative (semi)groups were proposed as a more efficient alternative to well established prot...
191
click to vote
DCOSS
2009
Springer
16 years 2 months ago
2009
Springer
We consider dual classes of geometric coverage problems, in which disks, corresponding to coverage regions of sensors, are used to cover a region or set of points in the plane. The...
260
click to vote
CVPR
2009
IEEE
17 years 2 months ago
2009
IEEE
In recent years, large databases of natural images have
become increasingly popular in the evaluation of face and
object recognition algorithms. However, Pinto et al. previously
...