2188 search results - page 311 / 438 » Instance-Optimal Geometric Algorithms |
138
click to vote
AVBPA
1997
Springer
15 years 7 months ago
1997
Springer
In this paper we describe a system to reliably localize the position of the speaker’s face and mouth in videophone sequences. A statistical scheme based on a subspace method is p...
135
click to vote
KDD
1997
ACM
15 years 7 months ago
1997
ACM
In this paper 1 we present a method for discovering approximately common motifs (also known as active motifs) in three dimensional (3D) molecules. Each node in a molecule is repre...
109
click to vote
STACS
1992
Springer
15 years 7 months ago
1992
Springer
In this paper we give a practical and e cient output-sensitive algorithm for constructing the display of a polyhedral terrain. It runs in Od + nlog2 n time and uses On n space, wh...
104
click to vote
CSR
2006
Springer
15 years 6 months ago
2006
Springer
For two strings a, b of lengths m, n respectively, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their LCS. In this paper, w...
110
click to vote
GECCO
2006
Springer
15 years 6 months ago
2006
Springer
This paper presents a new method for 3D cutting of geometrical space with application to airspace sectoring. This problem comes from the air traffic management but the proposed me...