Sciweavers

4850 search results - page 493 / 970
» Approximate Data Structures with Applications
Sort
View
IJCNN
2008
IEEE
16 years 2 months ago
Two-level clustering approach to training data instance selection: A case study for the steel industry
— Nowadays, huge amounts of information from different industrial processes are stored into databases and companies can improve their production efficiency by mining some new kn...
Heli Koskimäki, Ilmari Juutilainen, Perttu La...
217
Voted
CSCWD
2001
Springer
16 years 6 days ago
Update Algorithms for the Sketch Data Model
The authors have developed a new approach to database interoperability using the sketch data model. That technique has now been used in a number of applications, but an important ...
Michael Johnson, Robert D. Rosebrugh
SODA
2008
ACM
110views Algorithms» more  SODA 2008»
15 years 9 months ago
Why simple hash functions work: exploiting the entropy in a data stream
Hashing is fundamental to many algorithms and data structures widely used in practice. For theoretical analysis of hashing, there have been two main approaches. First, one can ass...
Michael Mitzenmacher, Salil P. Vadhan
ICDE
2008
IEEE
195views Database» more  ICDE 2008»
16 years 9 months ago
Scalable Rule-Based Gene Expression Data Classification
Abstract-- Current state-of-the-art association rule-based classifiers for gene expression data operate in two phases: (i) Association rule mining from training data followed by (i...
Mark A. Iwen, Willis Lang, Jignesh M. Patel
WWW
2008
ACM
16 years 8 months ago
Efficiently querying rdf data in triple stores
Efficiently querying RDF [1] data is being an important factor in applying Semantic Web technologies to real-world applications. In this context, many efforts have been made to st...
Ying Yan, Chen Wang, Aoying Zhou, Weining Qian, Li...