Sciweavers

1920 search results - page 246 / 384
» The Complexity of the A B C Problem
Sort
View
IJCAI
2007
15 years 7 months ago
Optimal Soft Arc Consistency
The Valued (VCSP) framework is a generic optimization framework with a wide range of applications. Soft arc consistency operations transform a VCSP into an equivalent problem by s...
Martin C. Cooper, Simon de Givry, Thomas Schiex
PDPTA
2003
15 years 7 months ago
Incorporating an XML Matching Engine in Distributed Brokering Systems
As systems such as peer-to-peer, Web Services, and Grid systems proliferate the Internet there have also been a significant increase in the number of devices that are networked to...
Shrideep Pallickara, Geoffrey Fox, Marlon E. Pierc...
APAL
2008
87views more  APAL 2008»
15 years 6 months ago
Characterising nested database dependencies by fragments of propositional logic
We extend the earlier results on the equivalence between the Boolean and the multivalued dependencies in relational databases and fragments of the Boolean propositional logic. It ...
Sven Hartmann, Sebastian Link
158
Voted
DAM
2011
15 years 29 days ago
Matchability and k-maximal matchings
We present a collection of new structural, algorithmic, and complexity results for two types of matching problems. The first problem involves the computation of k-maximal matchin...
Brian C. Dean, Sandra Mitchell Hedetniemi, Stephen...
SPEECH
2010
94views more  SPEECH 2010»
15 years 21 days ago
Predicting the phonetic realizations of word-final consonants in context - A challenge for French grapheme-to-phoneme converters
One of the main problems in developing a text-to-speech (TTS) synthesizer for French lies in grapheme-to-phoneme conversion. Automatic converters produce still too many errors in ...
Josafá de Jesus Aguiar Pontes, Sadaoki Furu...