Sciweavers

1101 search results - page 176 / 221
» Scalable Distributed Data Structures for High-Performance Da...
Sort
View
147
Voted
KDD
2012
ACM
194views Data Mining» more  KDD 2012»
13 years 4 months ago
A sparsity-inducing formulation for evolutionary co-clustering
Traditional co-clustering methods identify block structures from static data matrices. However, the data matrices in many applications are dynamic; that is, they evolve smoothly o...
Shuiwang Ji, Wenlu Zhang, Jun Liu
VLDB
1987
ACM
92views Database» more  VLDB 1987»
15 years 5 months ago
Mind Your Grammar: a New Approach to Modelling Text
Beginning to create the New Oxford English Dictionary database has resulted in the realization that databases for reference texts are unlike those for conventional enterprises. Wh...
Gaston H. Gonnet, Frank Wm. Tompa
CCS
2008
ACM
15 years 4 months ago
Authenticated hash tables
Hash tables are fundamental data structures that optimally answer membership queries. Suppose a client stores n elements in a hash table that is outsourced at a remote server so t...
Charalampos Papamanthou, Roberto Tamassia, Nikos T...
SC
2009
ACM
15 years 9 months ago
Exploring many task computing in scientific workflows
One of the main advantages of using a scientific workflow management system (SWfMS) to orchestrate data flows among scientific activities is to control and register the whole work...
Eduardo S. Ogasawara, Daniel de Oliveira, Fernando...
110
Voted
EUROPAR
2001
Springer
15 years 7 months ago
Self-Organizing Hierarchical Cluster Timestamps
Distributed-system observation tools require an efficient data structure to store and query the partial-order of execution. Such data structures typically use vector timestamps to...
Paul A. S. Ward, David J. Taylor