Sciweavers

4541 search results - page 329 / 909
» Cache-Oblivious Algorithms and Data Structures
Sort
View
138
Voted
ICANN
2010
Springer
15 years 4 months ago
Computational Properties of Probabilistic Neural Networks
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...
Jiri Grim, Jan Hora
ACSC
2002
IEEE
15 years 9 months ago
Suffix Vector: Space- and Time-Efficient Alternative to Suffix Trees
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...
Krisztián Monostori, Arkady B. Zaslavsky, H...
CVPR
2007
IEEE
16 years 6 months ago
Fiber Tract Clustering on Manifolds With Dual Rooted-Graphs
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...
Andy Tsai, Carl-Fredrik Westin, Alfred O. Hero, Al...
158
Voted
SPIRE
2010
Springer
15 years 2 months ago
Dual-Sorted Inverted Lists
Several IR tasks rely, to achieve high efficiency, on a single pervasive data structure called the inverted index. This is a mapping from the terms in a text collection to the docu...
Gonzalo Navarro, Simon J. Puglisi
KDD
2008
ACM
257views Data Mining» more  KDD 2008»
16 years 4 months ago
Knowledge discovery of semantic relationships between words using nonparametric bayesian graph model
We developed a model based on nonparametric Bayesian modeling for automatic discovery of semantic relationships between words taken from a corpus. It is aimed at discovering seman...
Issei Sato, Minoru Yoshida, Hiroshi Nakagawa