Sciweavers

339 search results - page 14 / 68
» Handling dynamic data structures in search based testing
Sort
View
ICDM
2002
IEEE
143views Data Mining» more  ICDM 2002»
14 years 20 days ago
Automatic Web Page Classification in a Dynamic and Hierarchical Way
Automatic classification of web pages is an effective way to deal with the difficulty of retrieving information from the Internet. Although there are many automatic classification...
Xiaogang Peng, Ben Choi
BMCBI
2010
124views more  BMCBI 2010»
13 years 7 months ago
A Dynamic Noise Level Algorithm for Spectral Screening of Peptide MS/MS Spectra
Background: High-throughput shotgun proteomics data contain a significant number of spectra from non-peptide ions or spectra of too poor quality to obtain highly confident peptide...
Hua Xu, Michael A. Freitas
SISAP
2009
IEEE
134views Data Mining» more  SISAP 2009»
14 years 2 months ago
EGNAT: A Fully Dynamic Metric Access Method for Secondary Memory
—We introduce a novel metric space search data structure called EGNAT, which is fully dynamic and designed for secondary memory. The EGNAT is based on Brin’s GNAT static index,...
Roberto Uribe Paredes, Gonzalo Navarro
EDBTW
2010
Springer
13 years 11 months ago
Text-to-query: dynamically building structured analytics to illustrate textual content
Successfully structuring information in databases, OLAP cubes, and XML is a crucial element in managing data nowadays. However this process brought new challenges to usability. It...
Raphaël Thollot, Falk Brauer, Wojciech M. Bar...
AINA
2009
IEEE
14 years 2 months ago
A Fast and Memory Efficient Dynamic IP Lookup Algorithm Based on B-Tree
—This paper deals with the traditional IP address lookup problem with fast updates. We propose a B-tree data structure, called MMSPT (Multiway Most Specific Prefix Tree), which i...
Yeim-Kuan Chang, Yung-Chieh Lin