Sciweavers

11231 search results - page 250 / 2247
» Digging for Data Structures
Sort
View
COSIT
2001
Springer
186views GIS» more  COSIT 2001»
15 years 11 months ago
Computational Structure in Three-Valued Nearness Relations
The development of cognitively plausible models of human spatial reasoning may ultimately result in computational systems that are better equipped to meet human needs. This paper e...
Matt Duckham, Michael F. Worboys
IJRR
2006
116views more  IJRR 2006»
15 years 6 months ago
The Graph SLAM Algorithm with Applications to Large-Scale Mapping of Urban Structures
This article presents GraphSLAM, a unifying algorithm for the offline SLAM problem. GraphSLAM is closely related to a recent sequence of research papers on applying optimization t...
Sebastian Thrun, Michael Montemerlo
CORR
2010
Springer
183views Education» more  CORR 2010»
15 years 5 months ago
Discovering shared and individual latent structure in multiple time series
This paper proposes a nonparametric Bayesian method for exploratory data analysis and feature construction in continuous time series. Our method focuses on understanding shared fe...
Suchi Saria, Daphne Koller, Anna Penn
EMNLP
2010
15 years 4 months ago
Efficient Graph-Based Semi-Supervised Learning of Structured Tagging Models
We describe a new scalable algorithm for semi-supervised training of conditional random fields (CRF) and its application to partof-speech (POS) tagging. The algorithm uses a simil...
Amarnag Subramanya, Slav Petrov, Fernando Pereira
SPIRE
2009
Springer
16 years 1 months ago
Directly Addressable Variable-Length Codes
We introduce a symbol reordering technique that implicitly synchronizes variable-length codes, such that it is possible to directly access the i-th codeword without need of any sam...
Nieves R. Brisaboa, Susana Ladra, Gonzalo Navarro