Sciweavers

93 search results - page 15 / 19
» Extracting k most important groups from data efficiently
Sort
View
98
Voted
BMCBI
2010
123views more  BMCBI 2010»
14 years 4 months ago
Predicting conserved protein motifs with Sub-HMMs
Background: Profile HMMs (hidden Markov models) provide effective methods for modeling the conserved regions of protein families. A limitation of the resulting domain models is th...
Kevin Horan, Christian R. Shelton, Thomas Girke
SSDBM
1999
IEEE
118views Database» more  SSDBM 1999»
15 years 1 months ago
Evaluation of Ad Hoc OLAP: In-Place Computation
Large scale data analysis and mining activities, such as identifying interesting trends, making unusual patterns to stand out and verifying hypotheses, require sophisticated infor...
Damianos Chatziantoniou
ICSM
2005
IEEE
15 years 3 months ago
Co-Change Visualization
Clustering layouts of software systems combine two important aspects: they reveal groups of related artifacts of the software system, and they produce a visualization of the resul...
Dirk Beyer
SIGMOD
2006
ACM
232views Database» more  SIGMOD 2006»
15 years 9 months ago
To search or to crawl?: towards a query optimizer for text-centric tasks
Text is ubiquitous and, not surprisingly, many important applications rely on textual data for a variety of tasks. As a notable example, information extraction applications derive...
Panagiotis G. Ipeirotis, Eugene Agichtein, Pranay ...
PPOPP
1990
ACM
15 years 1 months ago
Concurrent Aggregates (CA)
Toprogrammassivelyconcurrent MIMDmachines, programmersneed tools for managingcomplexity. One important tool that has been used in the sequential programmingworld is hierarchies of...
Andrew A. Chien, William J. Dally