Sciweavers

820 search results - page 53 / 164
» Finding low-utility data structures
Sort
View
ICDE
2005
IEEE
139views Database» more  ICDE 2005»
14 years 10 months ago
Compressing Bitmap Indices by Data Reorganization
Many scientific applications generate massive volumes of data through observations or computer simulations, bringing up the need for effective indexing methods for efficient stora...
Ali Pinar, Tao Tao, Hakan Ferhatosmanoglu
ALT
2004
Springer
14 years 5 months ago
String Pattern Discovery
Finding a good pattern which discriminates one set of strings from the other set is a critical task in knowledge discovery. In this paper, we review a series of our works concernin...
Ayumi Shinohara
CEAS
2006
Springer
14 years 14 days ago
An Email and Meeting Assistant Using Graph Walks
We describe a framework for representing email as well as meeting information as a joint graph. In the graph, documents and meeting descriptions are connected via other nontextual...
Einat Minkov, William W. Cohen
KDD
2007
ACM
155views Data Mining» more  KDD 2007»
14 years 9 months ago
A framework for community identification in dynamic social networks
We propose frameworks and algorithms for identifying communities in social networks that change over time. Communities are intuitively characterized as "unusually densely kni...
Chayant Tantipathananandh, Tanya Y. Berger-Wolf, D...
ICML
2009
IEEE
14 years 9 months ago
K-means in space: a radiation sensitivity evaluation
Spacecraft increasingly employ onboard data analysis to inform further data collection and prioritization decisions. However, many spacecraft operate in high-radiation environment...
Kiri L. Wagstaff, Benjamin Bornstein