Sciweavers

7015 search results - page 1323 / 1403
» Approximation algorithms for co-clustering
Sort
View
STOC
2005
ACM
132views Algorithms» more  STOC 2005»
14 years 9 months ago
Concurrent general composition of secure protocols in the timing model
In the setting of secure multiparty computation, a set of parties wish to to jointly compute some function of their input (i.e., they wish to securely carry out some distributed t...
Yael Tauman Kalai, Yehuda Lindell, Manoj Prabhakar...
SIGMOD
2008
ACM
138views Database» more  SIGMOD 2008»
14 years 9 months ago
Sampling time-based sliding windows in bounded space
Random sampling is an appealing approach to build synopses of large data streams because random samples can be used for a broad spectrum of analytical tasks. Users are often inter...
Rainer Gemulla, Wolfgang Lehner
SIGMOD
2008
ACM
191views Database» more  SIGMOD 2008»
14 years 9 months ago
Efficient aggregation for graph summarization
Graphs are widely used to model real world objects and their relationships, and large graph datasets are common in many application domains. To understand the underlying character...
Yuanyuan Tian, Richard A. Hankins, Jignesh M. Pate...
SIGMOD
2006
ACM
219views Database» more  SIGMOD 2006»
14 years 9 months ago
Modeling skew in data streams
Data stream applications have made use of statistical summaries to reason about the data using nonparametric tools such as histograms, heavy hitters, and join sizes. However, rela...
Flip Korn, S. Muthukrishnan, Yihua Wu
SIGMOD
2005
ACM
166views Database» more  SIGMOD 2005»
14 years 9 months ago
Substructure Similarity Search in Graph Databases
Advanced database systems face a great challenge raised by the emergence of massive, complex structural data in bioinformatics, chem-informatics, and many other applications. The ...
Xifeng Yan, Philip S. Yu, Jiawei Han
« Prev « First page 1323 / 1403 Last » Next »