Sciweavers

22 search results - page 2 / 5
» A theoretical and empirical study of EFSM dependence
Sort
View
NLE
2010
104views more  NLE 2010»
13 years 3 months ago
Interlingual annotation of parallel text corpora: a new framework for annotation and evaluation
This paper focuses on an important step in the creation of a system of meaning representation and the development of semantically-annotated parallel corpora, for use in applicatio...
Bonnie J. Dorr, Rebecca J. Passonneau, David Farwe...
SIGMOD
2006
ACM
116views Database» more  SIGMOD 2006»
14 years 5 months ago
Fast range-summable random variables for efficient aggregate estimation
Exact computation for aggregate queries usually requires large amounts of memory ? constrained in data-streaming ? or communication ? constrained in distributed computation ? and ...
Florin Rusu, Alin Dobra
CP
2003
Springer
13 years 10 months ago
Cost-Based Filtering for Shorter Path Constraints
Abstract. Many real world problems, e.g. personnel scheduling and transportation planning, can be modeled naturally as Constrained Shortest Path Problems (CSPPs), i.e., as Shortest...
Meinolf Sellmann
ET
2007
67views more  ET 2007»
13 years 4 months ago
A Formal Analysis of Fault Diagnosis with D-matrices
As new approaches and algorithms are developed for system diagnosis, it is important to reflect on existing approaches to determine their strengths and weaknesses. Of concern is i...
John W. Sheppard, S. G. W. Butcher
ML
2006
ACM
142views Machine Learning» more  ML 2006»
13 years 4 months ago
The max-min hill-climbing Bayesian network structure learning algorithm
We present a new algorithm for Bayesian network structure learning, called Max-Min Hill-Climbing (MMHC). The algorithm combines ideas from local learning, constraint-based, and sea...
Ioannis Tsamardinos, Laura E. Brown, Constantin F....