Sciweavers

308 search results - page 60 / 62
» How Fast Is the k-Means Method
Sort
View
123
Voted
VLDB
2001
ACM
114views Database» more  VLDB 2001»
15 years 7 months ago
Distinct Sampling for Highly-Accurate Answers to Distinct Values Queries and Event Reports
Estimating the number of distinct values is a wellstudied problem, due to its frequent occurrence in queries and its importance in selecting good query plans. Previous work has sh...
Phillip B. Gibbons
ICDCS
2010
IEEE
15 years 7 months ago
B-SUB: A Practical Bloom-Filter-Based Publish-Subscribe System for Human Networks
—The adoption of portable wireless devices is rapidly rising. The demand for efficient communication protocols amongst these devices is pressing. In this paper, we present a con...
Yaxiong Zhao, Jie Wu
ESA
1998
Springer
162views Algorithms» more  ESA 1998»
15 years 7 months ago
External Memory Algorithms
Abstract. Data sets in large applications are often too massive to t completely inside the computer's internal memory. The resulting input output communication or I O between ...
Jeffrey Scott Vitter
HPDC
2010
IEEE
15 years 4 months ago
Mendel: efficiently verifying the lineage of data modified in multiple trust domains
Data is routinely created, disseminated, and processed in distributed systems that span multiple administrative domains. To maintain accountability while the data is transformed b...
Ashish Gehani, Minyoung Kim
129
Voted
BMCBI
2010
148views more  BMCBI 2010»
15 years 3 months ago
Structuring heterogeneous biological information using fuzzy clustering of k-partite graphs
Background: Extensive and automated data integration in bioinformatics facilitates the construction of large, complex biological networks. However, the challenge lies in the inter...
Mara L. Hartsperger, Florian Blöchl, Volker S...