Sciweavers

8431 search results - page 70 / 1687
» Algorithmically Independent Sequences
Sort
View
CCCG
2010
14 years 11 months ago
Constrained k-center and movement to independence
We obtain hardness results and approximation algorithms for two related geometric problems involving movement. The first is a constrained variant of the k-center problem, arising ...
Adrian Dumitrescu, Minghui Jiang
ESANN
2006
14 years 11 months ago
Independent dynamics subspace analysis
Abstract. The paper presents an algorithm for identifying the independent subspace analysis model based on source dynamics. We propose to separate subspaces by decoupling their dyn...
Alexander Ilin
TROB
2008
154views more  TROB 2008»
14 years 8 months ago
Large-Scale SLAM Building Conditionally Independent Local Maps: Application to Monocular Vision
SLAM algorithms based on local maps have been demonstrated to be well suited for mapping large environments as they reduce the computational cost and improve the consistency of the...
Pedro Pinies, Juan D. Tardós
BMCBI
2004
125views more  BMCBI 2004»
14 years 9 months ago
A fast algorithm for determining the best combination of local alignments to a query sequence
Background: Existing sequence alignment algorithms assume that similarities between DNA or amino acid sequences are linearly ordered. That is, stretches of similar nucleotides or ...
Gavin C. Conant, Andreas Wagner
DCC
2005
IEEE
15 years 9 months ago
When is Bit Allocation for Predictive Video Coding Easy?
This paper addresses the problem of bit allocation among frames in a predictively encoded video sequence. Finding optimal solutions to this problem potentially requires making an ...
Yegnaswamy Sermadevi, Jun Chen, Sheila S. Hemami, ...