Sciweavers

44 search results - page 9 / 9
» Dynamic Planar Convex Hull
Sort
View
RECOMB
1997
Springer
13 years 9 months ago
A branch-and-cut algorithm for multiple sequence alignment
Multiple sequence alignment is an important problem in computational biology. We study the Maximum Trace formulation introduced by Kececioglu [?]. We first phrase the problem in ...
Knut Reinert, Hans-Peter Lenhof, Petra Mutzel, Kur...
ICRA
2000
IEEE
163views Robotics» more  ICRA 2000»
13 years 9 months ago
The Anthropomorphic Biped Robot BIP2000
This paper describes the progress of the BIP2000 project. This project, in which four laboratories are involved for 4 years, as uimed at the realization of the lower part of an an...
Bernard Espiau, Philippe Sardain
SODA
1994
ACM
105views Algorithms» more  SODA 1994»
13 years 6 months ago
Approximate Data Structures with Applications
Abstract Yossi Matias Je rey Scott Vitter y Neal E. Young z In this paper we introduce the notion of approximate data structures, in which a small amount of error is tolerated in...
Yossi Matias, Jeffrey Scott Vitter, Neal E. Young
4OR
2010
137views more  4OR 2010»
13 years 5 months ago
Extended formulations in combinatorial optimization
This survey is concerned with the size of perfect formulations for combinatorial optimization problems. By "perfect formulation", we mean a system of linear inequalities...
Michele Conforti, Gérard Cornuéjols,...