1996 search results - page 370 / 400 » Financial Theory 2 |
179
click to vote
STOC
1993
ACM
15 years 3 months ago
1993
ACM
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...
119
click to vote
CF
2007
ACM
15 years 3 months ago
2007
ACM
In the life sciences, genomic databases for sequence search have been growing exponentially in size. As a result, faster sequencesearch algorithms to search these databases contin...
STOC
2010
ACM
15 years 3 months ago
2010
ACM
Approximating pairwise, or k-wise, independence with sublinear memory is of considerable importance in the data stream model. In the streaming model the joint distribution is give...
136
click to vote
DIALM
2007
ACM
15 years 3 months ago
2007
ACM
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
100
click to vote
ICDCS
2010
IEEE
15 years 3 months ago
2010
IEEE
—This research focuses on distributed and localized algorithms for precise boundary detection in 3D wireless networks. Our objectives are in two folds. First, we aim to identify ...