Sciweavers

777 search results - page 66 / 156
» Declarative Data Cleaning: Language, Model, and Algorithms
Sort
View
ML
2008
ACM
100views Machine Learning» more  ML 2008»
13 years 8 months ago
Generalized ordering-search for learning directed probabilistic logical models
Abstract. Recently, there has been an increasing interest in directed probabilistic logical models and a variety of languages for describing such models has been proposed. Although...
Jan Ramon, Tom Croonenborghs, Daan Fierens, Hendri...
PLDI
2004
ACM
14 years 2 months ago
Parametric regular path queries
Regular path queries are a way of declaratively expressing queries on graphs as regular-expression-like patterns that are matched against paths in the graph. There are two kinds o...
Yanhong A. Liu, Tom Rothamel, Fuxiang Yu, Scott D....
JCST
2010
153views more  JCST 2010»
13 years 3 months ago
Model Failure and Context Switching Using Logic-Based Stochastic Models
Abstract We define a notion of context that represents invariant, stable-over-time behavior in an environment and we propose an algorithm for detecting context changes in a stream ...
Nikita A. Sakhanenko, George F. Luger
DAC
2003
ACM
14 years 9 months ago
Data communication estimation and reduction for reconfigurable systems
Widespread adoption of reconfigurable devices requires system level synthesis techniques to take an application written in a high level language and map it to the reconfigurable d...
Adam Kaplan, Philip Brisk, Ryan Kastner
CLEF
2009
Springer
13 years 10 months ago
Unsupervised Word Decomposition with the Promodes Algorithm
We present Promodes, an algorithm for unsupervised word decomposition, which is based on a probabilistic generative model. The model considers segment boundaries as hidden variable...
Sebastian Spiegler, Bruno Golénia, Peter A....