Sciweavers

4860 search results - page 819 / 972
» SNPs Problems, Complexity, and Algorithms
Sort
View
WWW
2008
ACM
16 years 7 months ago
Computing minimum cost diagnoses to repair populated DL-based ontologies
Ontology population is prone to cause inconsistency because the populating process is imprecise or the populated data may conflict with the original data. By assuming that the int...
Jianfeng Du, Yi-Dong Shen
GLOBECOM
2008
IEEE
16 years 25 days ago
Optimal LLR Clipping Levels for Mixed Hard/Soft Output Detection
Abstract—Consider a communications system where the detector generates a mix of hard and soft outputs, which are then fed into a soft-input channel decoder. In such a setting, it...
Ernesto Zimmermann, David L. Milliner, John R. Bar...
SIGECOM
2010
ACM
164views ECommerce» more  SIGECOM 2010»
15 years 11 months ago
Truthful mechanisms with implicit payment computation
It is widely believed that computing payments needed to induce truthful bidding is somehow harder than simply computing the allocation. We show that the opposite is true for singl...
Moshe Babaioff, Robert D. Kleinberg, Aleksandrs Sl...
FUIN
2008
136views more  FUIN 2008»
15 years 6 months ago
Multi-Dimensional Relational Sequence Mining
The issue addressed in this paper concerns the discovery of frequent multi-dimensional patterns from relational sequences. The great variety of applications of sequential pattern m...
Floriana Esposito, Nicola Di Mauro, Teresa Maria A...
EXPERT
1998
86views more  EXPERT 1998»
15 years 6 months ago
IMACS: A Case Study in Real-World Planning
This article illustrates the complexities of real-world planning and how we can create AI planning systems to address them. We describe the IMACS Project (Interactive Manufacturab...
Satyandra K. Gupta, Dana S. Nau, William C. Regli