Sciweavers

840 search results - page 99 / 168
» The Complexity of the Extended GCD Problem
Sort
View
BMCBI
2010
189views more  BMCBI 2010»
13 years 9 months ago
Efficient parallel and out of core algorithms for constructing large bi-directed de Bruijn graphs
Background: Assembling genomic sequences from a set of overlapping reads is one of the most fundamental problems in computational biology. Algorithms addressing the assembly probl...
Vamsi Kundeti, Sanguthevar Rajasekaran, Hieu Dinh,...
ESA
2009
Springer
156views Algorithms» more  ESA 2009»
14 years 3 months ago
On Revenue Maximization in Second-Price Ad Auctions
Abstract. Most recent papers addressing the algorithmic problem of allocating advertisement space for keywords in sponsored search auctions assume that pricing is done via a first...
Yossi Azar, Benjamin E. Birnbaum, Anna R. Karlin, ...
CVPR
2001
IEEE
14 years 11 months ago
Automatic Partitioning of High Dimensional Search Spaces Associated with Articulated Body Motion Capture
Particle filters have proven to be an effective tool for visual tracking in non-gaussian, cluttered environments. Conventional particle filters however do not scale to the problem...
Jonathan Deutscher, Andrew J. Davison, Ian D. Reid
CVPR
2004
IEEE
14 years 11 months ago
Globally Optimal Segmentation of Interacting Surfaces with Geometric Constraints
Abstract-- Efficient detection of globally optimal surfaces representing object boundaries in volumetric datasets is important and remains challenging in many medical image analysi...
Kang Li, Xiaodong Wu, Danny Z. Chen, Milan Sonka
ICML
2009
IEEE
14 years 10 months ago
Near-Bayesian exploration in polynomial time
We consider the exploration/exploitation problem in reinforcement learning (RL). The Bayesian approach to model-based RL offers an elegant solution to this problem, by considering...
J. Zico Kolter, Andrew Y. Ng