32545 search results - page 248 / 6509 » Data Structures and Algorithms |
235
click to vote
CORR
1999
Springer
15 years 6 months ago
1999
Springer
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
197
Voted
WEA
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. The suffix tree is an extremely important data structure for stringology, with a wealth of applications in bioinformatics. Classical implementations require much space, w...
203
click to vote
BMCBI
2008
15 years 6 months ago
2008
Background: Protein-protein interactions are ubiquitous and essential for all cellular processes. High-resolution X-ray crystallographic structures of protein complexes can reveal...
167
click to vote
FSKD
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. In this paper, we propose a novel classification algorithm, called geometrical probability covering (GPC) algorithm, to improve classification ability. On the basis of ...
196
click to vote
ICPR
2000
IEEE
16 years 7 months ago
2000
IEEE
We present a parallel implementation of a probabilistic algorithm for real time tracking of segments in noisy edge images. Given an initial solution ?a set of segments that reason...