Sciweavers

2252 search results - page 147 / 451
» Improving Random Forests
Sort
View
AAAI
1996
13 years 9 months ago
Improved Limited Discrepancy Search
We present an improvement to Harvey and Ginsberg's limited discrepancy search algorithm, which eliminates much of the redundancy in the original, by generating each path from...
Richard E. Korf
BMCBI
2008
162views more  BMCBI 2008»
13 years 8 months ago
Improved identification of conserved cassette exons using Bayesian networks
Background: Alternative splicing is a major contributor to the diversity of eukaryotic transcriptomes and proteomes. Currently, large scale detection of alternative splicing using...
Rileen Sinha, Michael Hiller, Rainer Pudimat, Ulri...
ALMOB
2006
155views more  ALMOB 2006»
13 years 8 months ago
Refining motifs by improving information content scores using neighborhood profile search
The main goal of the motif finding problem is to detect novel, over-represented unknown signals in a set of sequences (e.g. transcription factor binding sites in a genome). The mo...
Chandan K. Reddy, Yao-Chung Weng, Hsiao-Dong Chian...
IJNSEC
2007
204views more  IJNSEC 2007»
13 years 8 months ago
Enhanced DSR for MANET with Improved Secured Route Discovery and QoS
Mobile Ad hoc NETwork (MANET) comprises of nodes, which are free to move randomly, yet cooperate to forward packets between source and destination over a multi-hop wireless networ...
Anil Rawat, Prakash Dattatraya Vyavahare, Ashwani ...
BMCBI
2005
125views more  BMCBI 2005»
13 years 8 months ago
DIALIGN-T: An improved algorithm for segment-based multiple sequence alignment
Background: We present a complete re-implementation of the segment-based approach to multiple protein alignment that contains a number of improvements compared to the previous ver...
Amarendran R. Subramanian, Jan Weyer-Menkhoff, Mic...