Sciweavers

1068 search results - page 179 / 214
» Extremely randomized trees
Sort
View
BMCBI
2006
159views more  BMCBI 2006»
13 years 10 months ago
MultiSeq: unifying sequence and structure data for evolutionary analysis
Background: Since the publication of the first draft of the human genome in 2000, bioinformatic data have been accumulating at an overwhelming pace. Currently, more than 3 million...
Elijah Roberts, John Eargle, Dan Wright, Zaida Lut...
BMCBI
2005
109views more  BMCBI 2005»
13 years 9 months ago
Genome comparison without alignment using shortest unique substrings
Background: Sequence comparison by alignment is a fundamental tool of molecular biology. In this paper we show how a number of sequence comparison tasks, including the detection o...
Bernhard Haubold, Nora Pierstorff, Friedrich M&oum...
SCN
2011
Springer
348views Communications» more  SCN 2011»
13 years 4 months ago
MANET QoS support without reservations
An inelastic flow is a flow with inelastic rate: i.e., the rate is fixed, it cannot be dynamically adjusted to traffic and load condition as in elastic flows like TCP. Real ti...
Soon-Young Oh, Gustavo Marfia, Mario Gerla
CVPR
2007
IEEE
14 years 12 months ago
Approximate Nearest Subspace Search with Applications to Pattern Recognition
Linear and affine subspaces are commonly used to describe appearance of objects under different lighting, viewpoint, articulation, and identity. A natural problem arising from the...
Ronen Basri, Tal Hassner, Lihi Zelnik-Manor
ICML
2007
IEEE
14 years 10 months ago
Combining online and offline knowledge in UCT
The UCT algorithm learns a value function online using sample-based search. The TD() algorithm can learn a value function offline for the on-policy distribution. We consider three...
Sylvain Gelly, David Silver