112 search results - page 5 / 23 » Faster deterministic dictionaries |
ACL
2006
13 years 9 months ago
2006
We present a novel classifier-based deterministic parser for Chinese constituency parsing. Our parser computes parse trees from bottom up in one pass, and uses classifiers to make...
WADS
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Algorithms dealing with massive data sets are usually designed for I/O-efficiency, often captured by the I/O model by Aggarwal and Vitter. Another aspect of dealing with ...
ICML
2009
IEEE
14 years 8 months ago
2009
IEEE
Sparse coding--that is, modelling data vectors as sparse linear combinations of basis elements--is widely used in machine learning, neuroscience, signal processing, and statistics...
SODA
2012
ACM
11 years 10 months ago
2012
ACM
We consider the dictionary problem in external memory and improve the update time of the wellknown buffer tree by roughly a logarithmic factor. For any λ ≥ max{lg lg n, logM/B(...
ICPR
2010
IEEE
13 years 10 months ago
2010
IEEE
Recent approaches of graph comparison consider graphs as sets of paths [6, 5]. Kernels on graphs are then computed from kernels on paths. A common strategy for graph retrieval is ...