Sciweavers

306 search results - page 32 / 62
» Discovering Relational Patterns across Multiple Databases
Sort
View
BMCBI
2006
120views more  BMCBI 2006»
13 years 8 months ago
Integrating protein structures and precomputed genealogies in the Magnum database: Examples with cellular retinoid binding prote
Background: When accurate models for the divergent evolution of protein sequences are integrated with complementary biological information, such as folded protein structures, anal...
Michael E. Bradley, Steven A. Benner
TSE
2010
197views more  TSE 2010»
13 years 2 months ago
A Genetic Algorithm-Based Stress Test Requirements Generator Tool and Its Empirical Evaluation
Genetic algorithms (GAs) have been applied previously to UML-driven, stress test requirements generation with the aim of increasing chances of discovering faults relating to networ...
Vahid Garousi
KDD
2012
ACM
221views Data Mining» more  KDD 2012»
11 years 10 months ago
Fast mining and forecasting of complex time-stamped events
Given huge collections of time-evolving events such as web-click logs, which consist of multiple attributes (e.g., URL, userID, timestamp), how do we find patterns and trends? Ho...
Yasuko Matsubara, Yasushi Sakurai, Christos Falout...
CIKM
2009
Springer
14 years 20 days ago
An empirical study on using hidden markov model for search interface segmentation
This paper describes a hidden Markov model (HMM) based approach to perform search interface segmentation. Automatic processing of an interface is a must to access the invisible co...
Ritu Khare, Yuan An
BTW
2009
Springer
114views Database» more  BTW 2009»
13 years 11 months ago
Efficient Verification of B-tree Integrity
: The integrity of B-tree structures can become compromised for many reasons. Since these inconsistencies manifest themselves in unpredictable ways, all commercial database managem...
Goetz Graefe, R. Stonecipher