Sciweavers

2957 search results - page 161 / 592
» The Complexity of Polynomial-Time Approximation
Sort
View
ISCAS
2003
IEEE
124views Hardware» more  ISCAS 2003»
15 years 11 months ago
Convergent transfer subgraph characterization and computation
In this paper, we present a precise characterization of the existence of a convergent transfer subgraph in an edge colored directed acyclic graph. Based on the characterization, l...
Wing Ning Li
ASP
2003
Springer
15 years 11 months ago
Outlier Detection Using Default Logic
Default logic is used to describe regular behavior and normal properties. We suggest to exploit the framework of default logic for detecting outliers - individuals who behave in a...
Fabrizio Angiulli, Rachel Ben-Eliyahu-Zohary, Luig...
CSL
2003
Springer
15 years 11 months ago
Generating All Abductive Explanations for Queries on Propositional Horn Theories
Abstract. Abduction is a fundamental mode of reasoning, which has taken on increasing importance in Artificial Intelligence (AI) and related disciplines. Computing abductive expla...
Thomas Eiter, Kazuhisa Makino
ASIACRYPT
2000
Springer
15 years 10 months ago
Construction of Hyperelliptic Curves with CM and Its Application to Cryptosystems
Abstract. Construction of secure hyperelliptic curves is of most important yet most difficult problem in design of cryptosystems based on the discrete logarithm problems on hyperel...
Jinhui Chao, Kazuto Matsuo, Hiroto Kawashiro, Shig...
AGP
1999
IEEE
15 years 10 months ago
ACI1 constraints
Disunification is the problem of deciding satisfiability of a system of equations and disequations with respect to a given equational theory. In this paper we study the disunifica...
Agostino Dovier, Carla Piazza, Enrico Pontelli, Gi...