Sciweavers

161 search results - page 13 / 33
» Efficient Algorithms for Handling Molecular Weighted Sequenc...
Sort
View
MOC
2010
13 years 2 months ago
The number field sieve for integers of low weight
We define the weight of an integer N to be the smallest w such that N can be represented as w i=1 i2ci , with 1,..., w{1,-1}. Since arithmetic modulo a prime of low weight is parti...
Oliver Schirokauer
COLT
2006
Springer
13 years 11 months ago
Logarithmic Regret Algorithms for Online Convex Optimization
In an online convex optimization problem a decision-maker makes a sequence of decisions, i.e., chooses a sequence of points in Euclidean space, from a fixed feasible set. After ea...
Elad Hazan, Adam Kalai, Satyen Kale, Amit Agarwal
CVPR
2003
IEEE
14 years 9 months ago
Practical Super-Resolution from Dynamic Video Sequences
This paper introduces a practical approach for superresolution, the process of reconstructing a high-resolution image from the low-resolution input ones. The emphasis of our work ...
Zhongding Jiang, Tien-Tsin Wong, Hujun Bao
BMCBI
2005
109views more  BMCBI 2005»
13 years 7 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...
CVPR
2007
IEEE
14 years 9 months ago
Optimal Step Nonrigid ICP Algorithms for Surface Registration
We show how to extend the ICP framework to nonrigid registration, while retaining the convergence properties of the original algorithm. The resulting optimal step nonrigid ICP fra...
Brian Amberg, Sami Romdhani, Thomas Vetter