11211 search results - page 412 / 2243 » Data Structures |
210
Voted
FOSSACS
2005
Springer
16 years 10 days ago
2005
Springer
The general aim of this talk is to advocate a combinatorial perspective, together with its methods, in the investigation and study of models of computation structures. This, of cou...
255
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...
218
click to vote
CGI
2000
IEEE
15 years 11 months ago
2000
IEEE
We present a new approach for reconstructing a smooth surface from a set of scattered points in three-dimensional (3D) space. Our algorithm first decomposes a given point set int...
214
click to vote
BMCBI
2010
15 years 7 months ago
2010
Background: Protein alignments are an essential tool for many bioinformatics analyses. While sequence alignments are accurate for proteins of high sequence similarity, they become...
194
click to vote
SAC
2006
ACM
16 years 23 days ago
2006
ACM
Structured data and complex schemas are becoming the main way to represent the information many Digital Libraries provide, thus impacting the services they offer. When searching i...