492 search results - page 15 / 99 » The number of possibilities for random dating |
SODA
2004
ACM
13 years 10 months ago
2004
ACM
We are given a collection of m random subsequences (traces) of a string t of length n where each trace is obtained by deleting each bit in the string with probability q. Our goal ...
CORR
2011
Springer
13 years 3 months ago
2011
Springer
: We consider a game played between a hider, who hides a static object in one of several possible positions in a bounded planar region, and a searcher who wishes to reach the objec...
ICDCS
2011
IEEE
12 years 8 months ago
2011
IEEE
Abstract—Nowadays companies increasingly aggregate location data from different sources on the Internet to offer locationbased services such as estimating current road traffic c...
MOBIHOC
2007
ACM
14 years 8 months ago
2007
ACM
The issue of transport capacity of a randomly deployed wireless network under random (c, f ) channel assignment was considered by us in [1]. We showed in [1] that when the number ...
ITC
1994
IEEE
14 years 21 days ago
1994
IEEE
Previous approaches to designing random pattern testable circuits use post-synthesis test point insertion to eliminate random pattern resistant (r.p.r.) faults. The approach taken...