Sciweavers

1594 search results - page 126 / 319
» Fast Prediction on a Tree
Sort
View
118
Voted
BMCBI
2008
136views more  BMCBI 2008»
15 years 4 months ago
LOMA: A fast method to generate efficient tagged-random primers despite amplification bias of random PCR on pathogens
Background: Pathogen detection using DNA microarrays has the potential to become a fast and comprehensive diagnostics tool. However, since pathogen detection chips currently utili...
Wah-Heng Lee, Christopher W. Wong, Wan Yee Leong, ...
132
Voted
IROS
2009
IEEE
168views Robotics» more  IROS 2009»
15 years 10 months ago
On the generation of feasible paths for aerial robots in environments with obstacles
— This paper presents a methodology based on a variation of the Rapidly-exploring Random Trees (RRTs) that generates feasible trajectories for autonomous aerial vehicles with hol...
Douglas Guimarães Macharet, Armando Alves N...
NIPS
2008
15 years 5 months ago
A Scalable Hierarchical Distributed Language Model
Neural probabilistic language models (NPLMs) have been shown to be competitive with and occasionally superior to the widely-used n-gram language models. The main drawback of NPLMs...
Andriy Mnih, Geoffrey E. Hinton
PR
2006
132views more  PR 2006»
15 years 4 months ago
Some approaches to improve tree-based nearest neighbour search algorithms
Nearest neighbour search is a widely used technique in pattern recognition. During the last three decades a large number of fast algorithms have been proposed. In this work we are...
Eva Gómez-Ballester, Luisa Micó, Jos...
IPCO
2010
153views Optimization» more  IPCO 2010»
15 years 2 months ago
An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming
We present a branch-and-bound algorithm for minimizing a convex quadratic objective function over integer variables subject to convex constraints. In a given node of the enumerati...
Christoph Buchheim, Alberto Caprara, Andrea Lodi