4536 search results - page 342 / 908 » Contention-Sensitive Data Structures and Algorithms |
163
click to vote
ESA
2000
Springer
15 years 10 months ago
2000
Springer
We show that a popular variant of the well known k-d tree data structure satisfies an important packing lemma. This variant is a binary spatial partitioning tree T defined on a set...
180
Voted
ICANN
2010
Springer
15 years 7 months ago
2010
Springer
We discuss the problem of overfitting of probabilistic neural networks in the framework of statistical pattern recognition. The probabilistic approach to neural networks provides a...
179
click to vote
CPM
2005
Springer
16 years 9 days ago
2005
Springer
Gene structure prediction is one of the most important problems in computational molecular biology. It involves two steps: the first is finding the evidence (e.g. predicting spl...
175
click to vote
ACSC
2002
IEEE
15 years 11 months ago
2002
IEEE
Suffix trees are versatile data structures that are used for solving many string-matching problems. One of the main arguments against widespread usage of the structure is its spac...
179
click to vote
CVPR
2007
IEEE
16 years 8 months ago
2007
IEEE
We propose a manifold learning approach to fiber tract clustering using a novel similarity measure between fiber tracts constructed from dual-rooted graphs. In particular, to gene...