Sciweavers

1731 search results - page 307 / 347
» Maximum likelihood analysis of algorithms and data structure...
Sort
View
BMCBI
2008
95views more  BMCBI 2008»
13 years 7 months ago
PURE: A webserver for the prediction of domains in unassigned regions in proteins
Background: Protein domains are the structural and functional units of proteins. The ability to parse proteins into different domains is important for effective classification, un...
Chilamakuri C. S. Reddy, Khader Shameer, Bernard O...
ESA
2003
Springer
116views Algorithms» more  ESA 2003»
14 years 1 months ago
Smoothed Motion Complexity
We propose a new complexity measure for movement of objects, the smoothed motion complexity. Many applications are based on algorithms dealing with moving objects, but usually data...
Valentina Damerow, Friedhelm Meyer auf der Heide, ...
GECCO
2007
Springer
162views Optimization» more  GECCO 2007»
14 years 1 months ago
Some novel locality results for the blob code spanning tree representation
The Blob Code is a bijective tree code that represents each tree on n labelled vertices as a string of n − 2 vertex labels. In recent years, several researchers have deployed th...
Tim Paulden, David K. Smith
COMPSAC
2007
IEEE
13 years 11 months ago
AOP-based automated unit test classification of large benchmarks
Despite the availability of a variety of program analysis tools, evaluation of these tools is difficult, as only few benchmark suites exist. Existing benchmark suites lack the uni...
Cyrille Artho, Zhongwei Chen, Shinichi Honiden
DEXA
2006
Springer
193views Database» more  DEXA 2006»
13 years 11 months ago
Understanding and Enhancing the Folding-In Method in Latent Semantic Indexing
Abstract. Latent Semantic Indexing(LSI) has been proved to be effective to capture the semantic structure of document collections. It is widely used in content-based text retrieval...
Xiang Wang 0002, Xiaoming Jin