Sciweavers

1421 search results - page 88 / 285
» Algorithms for subsequence combinatorics
Sort
View
ESA
2003
Springer
77views Algorithms» more  ESA 2003»
15 years 9 months ago
An Optimal Algorithm for the Maximum-Density Segment Problem
We address a fundamental problem arising from analysis of biomolecular sequences. The input consists of two numbers wmin and wmax and a sequence S of n number pairs (ai, wi) with ...
Kai-min Chung, Hsueh-I Lu
CSB
2002
IEEE
121views Bioinformatics» more  CSB 2002»
15 years 9 months ago
Fast and Sensitive Algorithm for Aligning ESTs to Human Genome
There is a pressing need to align growing set of expressed sequence tags (ESTs) to newly sequenced human genome. The problem is, however, complicated by the exon/intron structure ...
Jun Ogasawara, Shinichi Morishita
122
Voted
ICRA
2002
IEEE
146views Robotics» more  ICRA 2002»
15 years 9 months ago
Algorithms and Sensors for Small Robot Path Following
Abstract— Tracked mobile robots in the 20 kg size class are under development for applications in urban reconnaissance. For efficient deployment, it is desirable for teams of ro...
Robert W. Hogg, Arturo L. Rankin, Stergios I. Roum...
WSCG
2003
224views more  WSCG 2003»
15 years 5 months ago
Edge-Enhancement - An Algorithm for Real-Time Non-Photorealistic Rendering
In this paper, we propose an algorithm for enhancing edges of real-time non-photorealistic renderings. It is based on the edge map, a 2D texture that encodes visually important ed...
Marc Nienhaus, Jürgen Döllner
148
Voted
AMAI
1999
Springer
15 years 3 months ago
Maintenance scheduling problems as benchmarks for constraint algorithms
The paper focuses on evaluating constraint satisfaction search algorithms on application based random problem instances. The application we use is a well-studied problem in the el...
Daniel Frost, Rina Dechter