Sciweavers

2314 search results - page 104 / 463
» Monoids over domains
Sort
View
JAIR
2011
103views more  JAIR 2011»
14 years 8 months ago
Automated Search for Impossibility Theorems in Social Choice Theory: Ranking Sets of Objects
We present a method for using standard techniques from satisfiability checking to automatically verify and discover theorems in an area of economic theory known as ranking sets o...
C. Geist, Ulrich Endriss
ICDE
2007
IEEE
125views Database» more  ICDE 2007»
16 years 3 months ago
Ontology-Based Constraint Recognition for Free-Form Service Requests
Automatic recognition and formalization of constraints from free-form service requests is a challenging problem. Its resolution would go a long way toward allowing users to make r...
Muhammed Al-Muhammed, David W. Embley
ICASSP
2009
IEEE
15 years 8 months ago
Resampling auxiliary data for language model adaptation in machine translation for speech
Performance of n-gram language models depends to a large extent on the amount of training text material available for building the models and the degree to which this text matches...
Sameer Maskey, Abhinav Sethy
BIBE
2008
IEEE
100views Bioinformatics» more  BIBE 2008»
15 years 8 months ago
Flexible data integration and ontology-based data access to medical records
— The ASSIST project aims to facilitate cervical cancer research by integrating medical records containing both phenotypic and genotypic data, and residing in different medical c...
Lucas Zamboulis, Alexandra Poulovassilis, George R...
ATAL
2005
Springer
15 years 7 months ago
Tunably decentralized algorithms for cooperative target observation
Multi-agent problem domains may require distributed algorithms for a variety of reasons: local sensors, limitations of communication, and availability of distributed computational...
Sean Luke, Keith Sullivan, Liviu Panait, Gabriel C...