1806 search results - page 65 / 362 » Randomness and halting probabilities |
INFOCOM
2008
IEEE
15 years 6 months ago
2008
IEEE
—We consider a time-slotted multipacket reception channel, shared by a finite number of mobile users who transmit to a common base station. Each user is allocated a fixed data ...
CSR
2007
Springer
15 years 6 months ago
2007
Springer
Consider a family of sets and a single set, called query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Strict time cons...
ISPAN
1999
IEEE
15 years 4 months ago
1999
IEEE
A network G is called random-fault-tolerant (RFT) network for a network G if G contains a fault-free isomorphic copy of G with high probability even if each processor fails indepe...
CORR
2010
Springer
14 years 12 months ago
2010
Springer
Consider a family of sets and a single set, called the query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Time constra...
100
Voted
DCG
2008
14 years 12 months ago
2008
Recently there has been a lot of interest in geometrically motivated approaches to data analysis in high dimensional spaces. We consider the case where data is drawn from sampling...