1101 search results - page 196 / 221 » Scalable Distributed Data Structures for High-Performance Da... |
141
click to vote
PODS
2005
ACM
16 years 2 months ago
2005
ACM
Suppose we have a large table T of items i, each with a weight wi, e.g., people and their salary. In a general preprocessing step for estimating arbitrary subset sums, we assign e...
195
click to vote
FOCS
2010
IEEE
15 years 6 days ago
2010
IEEE
Boosting is a general method for improving the accuracy of learning algorithms. We use boosting to construct improved privacy-preserving synopses of an input database. These are da...
124
click to vote
IPPS
1999
IEEE
15 years 6 months ago
1999
IEEE
We present new parallel algorithms for 3D reconstruction of objects from 2D projections and their application for the determination of the structure of macromolecules from electro...
112
click to vote
ACISP
1997
Springer
15 years 6 months ago
1997
Springer
tracts, pp. 11-17. (http://www.qucis.queens.ca/achallc97/papers/p028.html) Alexa, Melina; Rostek, Lothar Pattern Concordances - TATOE calls XGrammar. Presented at ACH -ALLC97, King...
114
click to vote
SIGMOD
2010
ACM
15 years 7 months ago
2010
ACM
As the study of graphs, such as web and social graphs, becomes increasingly popular, the requirements of efficiency and programming flexibility of large graph processing tasks c...