Sciweavers

874 search results - page 101 / 175
» Faster Algorithms for Semi-Matching Problems
Sort
View
ICRA
2010
IEEE
120views Robotics» more  ICRA 2010»
14 years 8 months ago
Approximation of feasibility tests for reactive walk on HRP-2
— We present here an original approach to test the feasibility of footsteps for a given walking pattern generator. It is based on a new approximation algorithm intended to cope w...
Nicolas Perrin, Olivier Stasse, Florent Lamiraux, ...
ECML
2005
Springer
15 years 3 months ago
Fast Non-negative Dimensionality Reduction for Protein Fold Recognition
Abstract. In this paper, dimensionality reduction via matrix factorization with nonnegativity constraints is studied. Because of these constraints, it stands apart from other linea...
Oleg Okun, Helen Priisalu, Alexessander Alves
ISCAS
2006
IEEE
106views Hardware» more  ISCAS 2006»
15 years 4 months ago
A novel approach to L2-sensitivity minimization of digital filters subject to L2-scaling constraints
Abstract— This paper proposes a novel approach to L2sensitivity minimization problem of state-space digital filters subject to L2-scaling constraints. The proposed approach redu...
Shunsuke Yamaki, Masahide Abe, Masayuki Kawamata
DCOSS
2009
Springer
15 years 4 months ago
Cheap or Flexible Sensor Coverage
We consider dual classes of geometric coverage problems, in which disks, corresponding to coverage regions of sensors, are used to cover a region or set of points in the plane. The...
Amotz Bar-Noy, Theodore Brown, Matthew P. Johnson,...
ISAAC
2004
Springer
125views Algorithms» more  ISAAC 2004»
15 years 3 months ago
Local Gapped Subforest Alignment and Its Application in Finding RNA Structural Motifs
RNA molecules whose secondary structures contain similar substructures often have similar functions. Therefore, an important task in the study of RNA is to develop methods for disc...
Jesper Jansson, Ngo Trung Hieu, Wing-Kin Sung