Sciweavers

1816 search results - page 292 / 364
» A New Approach for Solving the Maximum Clique Problem
Sort
View
RECOMB
2002
Springer
16 years 7 months ago
Deconvolving sequence variation in mixed DNA populations
We present an original approach to identifying sequence variants in a mixed DNA population from sequence trace data. The heart of the method is based on parsimony: given a wildtyp...
Andy Wildenberg, Steven Skiena, Pavel Sumazin
CVPR
2010
IEEE
16 years 3 months ago
Surface Extraction from Binary Volumes with Higher-Order Smoothness
A number of 3D shape reconstruction algorithms, in particular 3D image segmentation methods, produce their results in the form of binary volumes, where a binary value indicates whe...
Victor Lempitsky
CVPR
2010
IEEE
16 years 3 months ago
Online-Batch Strongly Convex Multi Kernel Learning
Several object categorization algorithms use kernel methods over multiple cues, as they offer a principled approach to combine multiple cues, and to obtain state-of-theart perform...
Francesco Orabona, Jie Luo, Barbara Caputo
ICCS
2009
Springer
16 years 1 months ago
Experience with Approximations in the Trust-Region Parallel Direct Search Algorithm
Recent years have seen growth in the number of algorithms designed to solve challenging simulation-based nonlinear optimization problems. One such algorithm is the Trust-Region Par...
S. M. Shontz, V. E. Howle, P. D. Hough
ICRA
2007
IEEE
130views Robotics» more  ICRA 2007»
16 years 1 months ago
Greedy but Safe Replanning under Kinodynamic Constraints
— We consider motion planning problems for a vehicle with kinodynamic constraints, where there is partial knowledge about the environment and replanning is required. We present a...
Kostas E. Bekris, Lydia E. Kavraki