820 search results - page 24 / 164 » Finding low-utility data structures |
SIGMOD
2007
ACM
14 years 8 months ago
2007
ACM
Data availability, collection and storage have increased dramatically in recent years, raising new technological and algorithmic challenges for database design and data management...
MICCAI
2008
Springer
14 years 9 months ago
2008
Springer
We present a method for discovering patterns of activation observed through fMRI in experiments with multiple stimuli/tasks. We introduce an explicit parameterization for the profi...
PLDI
1994
ACM
14 years 22 days ago
1994
ACM
In this paper, we describe the program structure tree (PST), a hierarchical representation of program structure based on single entry single exit (SESE) regions of the control flo...
ICML
2009
IEEE
14 years 9 months ago
2009
IEEE
Markov logic networks (MLNs) combine logic and probability by attaching weights to first-order clauses, and viewing these as templates for features of Markov networks. Learning ML...
KDD
2007
ACM
14 years 9 months ago
2007
ACM
Network clustering (or graph partitioning) is an important task for the discovery of underlying structures in networks. Many algorithms find clusters by maximizing the number of i...