Sciweavers

1315 search results - page 215 / 263
» Discovering significant rules
Sort
View
AAAI
2008
15 years 2 months ago
H-DPOP: Using Hard Constraints for Search Space Pruning in DCOP
In distributed constraint optimization problems, dynamic programming methods have been recently proposed (e.g. DPOP). In dynamic programming many valuations are grouped together i...
Akshat Kumar, Adrian Petcu, Boi Faltings
ECAI
2008
Springer
15 years 1 months ago
A BDD Approach to the Feature Subscription Problem
Modern feature-rich telecommunications services offer significant opportunities to human users. To make these services more usable, facilitating personalisation is very important s...
Tarik Hadzic, David Lesaint, Deepak Mehta, Barry O...
APPROX
2010
Springer
176views Algorithms» more  APPROX 2010»
15 years 1 months ago
Approximation Algorithms for Min-Max Generalization Problems
Abstract. We provide improved approximation algorithms for the minmax generalization problems considered by Du, Eppstein, Goodrich, and Lueker [1]. In min-max generalization proble...
Piotr Berman, Sofya Raskhodnikova
ACL
2008
15 years 1 months ago
Automatic Editing in a Back-End Speech-to-Text System
Written documents created through dictation differ significantly from a true verbatim transcript of the recorded speech. This poses an obstacle in automatic dictation systems as s...
Maximilian Bisani, Paul Vozila, Olivier Divay, Jef...
LREC
2008
131views Education» more  LREC 2008»
15 years 1 months ago
Chinese Term Extraction Based on Delimiters
Existing techniques extract term candidates by looking for internal and contextual information associated with domain specific terms. The algorithms always face the dilemma that f...
Yuhang Yang, Qin Lu, Tiejun Zhao