Sciweavers

777 search results - page 60 / 156
» Declarative Data Cleaning: Language, Model, and Algorithms
Sort
View
EMNLP
2010
13 years 6 months ago
An Efficient Algorithm for Unsupervised Word Segmentation with Branching Entropy and MDL
This paper proposes a fast and simple unsupervised word segmentation algorithm that utilizes the local predictability of adjacent character sequences, while searching for a leaste...
Valentin Zhikov, Hiroya Takamura, Manabu Okumura
EDBT
2010
ACM
145views Database» more  EDBT 2010»
14 years 4 days ago
Splash: ad-hoc querying of data and statistical models
Data mining is increasingly performed by people who are not computer scientists or professional programmers. It is often done as an iterative process involving multiple ad-hoc tas...
Lujun Fang, Kristen LeFevre
POPL
2006
ACM
14 years 9 months ago
A hierarchical model of data locality
In POPL 2002, Petrank and Rawitz showed a universal result-finding optimal data placement is not only NP-hard but also impossible to approximate within a constant factor if P = NP...
Chengliang Zhang, Chen Ding, Mitsunori Ogihara, Yu...
ICSE
2005
IEEE-ACM
14 years 9 months ago
Data structure repair using goal-directed reasoning
Data structure repair is a promising technique for enabling programs to execute successfully in the presence of otherwise fatal data structure corruption errors. Previous research...
Brian Demsky, Martin C. Rinard
ICDE
1997
IEEE
172views Database» more  ICDE 1997»
14 years 1 months ago
Modeling and Querying Moving Objects
In this paper we propose a data model for representing moving objects in database systems. It is called the Moving Objects Spatio-Temporal (MOST) data model. We also propose Futur...
A. Prasad Sistla, Ouri Wolfson, Sam Chamberlain, S...