Sciweavers

11213 search results - page 38 / 2243
» Low-contention data structures
Sort
View
CORR
2010
Springer
183views Education» more  CORR 2010»
14 years 8 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
14 years 7 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
83
Voted
ICIP
2009
IEEE
14 years 7 months ago
An automatic Structure-Aware image extrapolation applied to error concealment
A novel framework for spatially estimating unknown image data is presented. Common applications include inpainting, concealment of transmission errors, prediction in video coding,...
Haricharan Lakshman, Patrick Ndjiki-Nya, Martin K&...
74
Voted
DAWAK
2003
Springer
15 years 2 months ago
Automatic Detection of Structural Changes in Data Warehouses
Data Warehouses provide sophisticated tools for analyzing complex data online, in particular by aggregating data along dimensions spanned by master data. Changes to these master da...
Johann Eder, Christian Koncilia, Dieter Mitsche
SODA
2010
ACM
144views Algorithms» more  SODA 2010»
14 years 8 months ago
Cell-Probe Lower Bounds for Succinct Partial Sums
The partial sums problem in succinct data structures asks to preprocess an array A[1 . . n] of bits into a data structure using as close to n bits as possible, and answer queries ...
Mihai Patrascu, Emanuele Viola