3384 search results - page 583 / 677 » More Testable Properties |
MOBIHOC
2006
ACM
14 years 8 months ago
2006
ACM
This paper presents a distributed implementation of RAND, a randomized time slot scheduling algorithm, called DRAND. DRAND runs in O() time and message complexity where is the max...
DCC
2004
IEEE
14 years 8 months ago
2004
IEEE
In the discrete filtering problem, a data sequence over a finite alphabet is assumed to be corrupted by a discrete memoryless channel. The goal is to reconstruct the clean sequenc...
SODA
2010
ACM
14 years 6 months ago
2010
ACM
We present a simple and practical algorithm for the c-approximate near neighbor problem (c-NN): given n points P Rd and radius R, build a data structure which, given q Rd , can ...
SDM
2009
SIAM
14 years 6 months ago
2009
SIAM
Graphs appear in several settings, like social networks, recommendation systems, computer communication networks, gene/protein biological networks, among others. A deep, recurring...
SDM
2009
SIAM
14 years 6 months ago
2009
SIAM
The increasing availability of network data is creating a great potential for knowledge discovery from graph data. In many applications, feature vectors are given in addition to g...