Sciweavers

506 search results - page 28 / 102
» Automated Search for Heuristic Functions
Sort
View
VLDB
1997
ACM
170views Database» more  VLDB 1997»
13 years 11 months ago
M-tree: An Efficient Access Method for Similarity Search in Metric Spaces
A new access method, called M-tree, is proposed to organize and search large data sets from a generic "metric space", i.e. where object proximity is only defined by a di...
Paolo Ciaccia, Marco Patella, Pavel Zezula
BMCBI
2002
126views more  BMCBI 2002»
13 years 7 months ago
RIO: Analyzing proteomes by automated phylogenomics using resampled inference of orthologs
Background: When analyzing protein sequences using sequence similarity searches, orthologous sequences (that diverged by speciation) are more reliable predictors of a new protein&...
Christian M. Zmasek, Sean R. Eddy
TOPNOC
2008
13 years 7 months ago
Directed Unfolding of Petri Nets
The key to efficient on-the-fly reachability analysis based on unfolding is to focus the expansion of the finite prefix towards the desired marking. However, current unfolding stra...
Blai Bonet, Patrik Haslum, Sarah L. Hickmott, Sylv...
SIGSOFT
2007
ACM
14 years 8 months ago
The impact of input domain reduction on search-based test data generation
There has recently been a great deal of interest in search? based test data generation, with many local and global search algorithms being proposed. However, to date, there has be...
Mark Harman, Youssef Hassoun, Kiran Lakhotia, Phil...
ICBA
2004
Springer
165views Biometrics» more  ICBA 2004»
14 years 1 months ago
Towards an Automated Dental Identification System (ADIS)
This paper addresses the problem of developing an automated system for postmortem identification using dental records. The Automated Dental Identification System (ADIS) can be use...
Gamal Fahmy, Diaa Eldin M. Nassar, Eyad Haj-Said, ...