Sciweavers

4177 search results - page 800 / 836
» On the Performance of Ant-based Clustering
Sort
View
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
2007
ACM
186views Database» more  SIGMOD 2007»
14 years 9 months ago
An efficient and accurate method for evaluating time series similarity
A variety of techniques currently exist for measuring the similarity between time series datasets. Of these techniques, the methods whose matching criteria is bounded by a specifi...
Michael D. Morse, Jignesh M. Patel
SIGMOD
2006
ACM
111views Database» more  SIGMOD 2006»
14 years 9 months ago
Reconciling while tolerating disagreement in collaborative data sharing
In many data sharing settings, such as within the biological and biomedical communities, global data consistency is not always attainable: different sites' data may be dirty,...
Nicholas E. Taylor, Zachary G. Ives
SIGMOD
2002
ACM
129views Database» more  SIGMOD 2002»
14 years 9 months ago
Dwarf: shrinking the PetaCube
Dwarf is a highly compressed structure for computing, storing, and querying data cubes. Dwarf identifies prefix and suffix structural redundancies and factors them out by coalesci...
Yannis Sismanis, Antonios Deligiannakis, Nick Rous...
MOBIHOC
2007
ACM
14 years 8 months ago
Bounds for the capacity of wireless multihop networks imposed by topology and demand
Existing work on the capacity of wireless networks predominantly considers homogeneous random networks with random work load. The most relevant bounds on the network capacity, e.g...
Alireza Keshavarz-Haddad, Rudolf H. Riedi