Sciweavers

7930 search results - page 1505 / 1586
» Greedy in Approximation Algorithms
Sort
View
229
Voted
SIGMOD
2008
ACM
191views Database» more  SIGMOD 2008»
16 years 3 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...
250
Voted
SIGMOD
2006
ACM
219views Database» more  SIGMOD 2006»
16 years 3 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
141
Voted
SIGMOD
2005
ACM
166views Database» more  SIGMOD 2005»
16 years 3 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
157
Voted
PODS
2005
ACM
151views Database» more  PODS 2005»
16 years 3 months ago
Estimating arbitrary subset sums with few probes
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...
Noga Alon, Nick G. Duffield, Carsten Lund, Mikkel ...
147
Voted
MOBIHOC
2005
ACM
16 years 3 months ago
On the node-scheduling approach to topology control in ad hoc networks
: In this paper, we analyze the node scheduling approach of topology control in the context of reliable packet delivery. In node scheduling, only a minimum set of nodes needed for ...
Budhaditya Deb, Badri Nath
« Prev « First page 1505 / 1586 Last » Next »