Sciweavers

4850 search results - page 174 / 970
» Approximate Data Structures with Applications
Sort
View
IPMI
2007
Springer
16 years 7 months ago
Bayesian Tracking of Elongated Structures in 3D Images
Tracking of tubular elongated structures is an important goal in a wide range of biomedical imaging applications. A Bayesian tube tracking algorithm is presented that allows to eas...
Michiel Schaap, Ihor Smal, Coert Metz, Theo van Wa...
JODS
2007
102views Data Mining» more  JODS 2007»
15 years 6 months ago
Default Clustering with Conceptual Structures
This paper describes a theoretical framework for inducing knowledge from incomplete data sets. The general framework can be used with any formalism based on a lattice structure. It...
Julien Velcin, Jean-Gabriel Ganascia
COLING
2010
15 years 1 months ago
Varro: An Algorithm and Toolkit for Regular Structure Discovery in Treebanks
The Varro toolkit is a system for identifying and counting a major class of regularity in treebanks and annotated natural language data in the form of treestructures: frequently r...
Scott Martens
JMLR
2010
141views more  JMLR 2010»
15 years 1 months ago
Hierarchical Gaussian Process Regression
We address an approximation method for Gaussian process (GP) regression, where we approximate covariance by a block matrix such that diagonal blocks are calculated exactly while o...
Sunho Park, Seungjin Choi
CPM
2005
Springer
206views Combinatorics» more  CPM 2005»
16 years 1 days ago
A Fast Algorithm for Approximate String Matching on Gene Sequences
Abstract. Approximate string matching is a fundamental and challenging problem in computer science, for which a fast algorithm is highly demanded in many applications including tex...
Zheng Liu, Xin Chen, James Borneman, Tao Jiang