Sciweavers

11231 search results - page 456 / 2247
» Digging for Data Structures
Sort
View
JMLR
2010
101views more  JMLR 2010»
15 years 2 months ago
Exploiting Feature Covariance in High-Dimensional Online Learning
Some online algorithms for linear classification model the uncertainty in their weights over the course of learning. Modeling the full covariance structure of the weights can prov...
Justin Ma, Alex Kulesza, Mark Dredze, Koby Crammer...
CORR
2011
Springer
215views Education» more  CORR 2011»
15 years 2 months ago
The total path length of split trees
We consider the model of random trees introduced by Devroye [SIAM J Comput 28, 409– 432, 1998]. The model encompasses many important randomized algorithms and data structures. T...
Nicolas Broutin, Cecilia Holmgren
202
Voted
3DPH
2009
145views Healthcare» more  3DPH 2009»
15 years 5 months ago
The Persistent Morse Complex Segmentation of a 3-Manifold
We describe an algorithm for segmenting three-dimensional medical imaging data modeled as a continuous function on a 3-manifold. It is related to watershed algorithms developed in ...
Herbert Edelsbrunner, John Harer
ACL
2012
13 years 10 months ago
Movie-DiC: a Movie Dialogue Corpus for Research and Development
This paper describes Movie-DiC a Movie Dialogue Corpus recently collected for research and development purposes. The collected dataset comprises 132,229 dialogues containing a tot...
Rafael E. Banchs
216
Voted
DASFAA
2003
IEEE
151views Database» more  DASFAA 2003»
16 years 1 months ago
Approximate String Matching in DNA Sequences
Approximate string matching on large DNA sequences data is very important in bioinformatics. Some studies have shown that suffix tree is an efficient data structure for approxim...
Lok-Lam Cheng, David Wai-Lok Cheung, Siu-Ming Yiu