Sciweavers

692 search results - page 117 / 139
» Publishing and Distributing
Sort
View
KDD
2008
ACM
165views Data Mining» more  KDD 2008»
15 years 10 months ago
Colibri: fast mining of large static and dynamic graphs
Low-rank approximations of the adjacency matrix of a graph are essential in finding patterns (such as communities) and detecting anomalies. Additionally, it is desirable to track ...
Hanghang Tong, Spiros Papadimitriou, Jimeng Sun, P...
67
Voted
KDD
2005
ACM
104views Data Mining» more  KDD 2005»
15 years 10 months ago
A hit-miss model for duplicate detection in the WHO drug safety database
The WHO Collaborating Centre for International Drug Monitoring in Uppsala, Sweden, maintains and analyses the world's largest database of reports on suspected adverse drug re...
Andrew Bate, G. Niklas Norén, Roland Orre
KDD
2001
ACM
163views Data Mining» more  KDD 2001»
15 years 10 months ago
Learning to recognize brain specific proteins based on low-level features from on-line prediction servers
During the last decade, the area of bioinformatics has produced an overwhelming amount of data, with the recently published draft of the human genome being the most prominent exam...
Henrik Boström, Joakim Cöster, Lars Aske...
SIGMOD
2003
ACM
136views Database» more  SIGMOD 2003»
15 years 9 months ago
A Characterization of the Sensitivity of Query Optimization to Storage Access Cost Parameters
Most relational query optimizers make use of information about the costs of accessing tuples and data structures on various storage devices. This information can at times be off b...
Frederick Reiss, Tapas Kanungo
SIGMOD
2002
ACM
129views Database» more  SIGMOD 2002»
15 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...