AAAI
2008
2008
Abduction with Bounded Treewidth: From Theoretical Tractability to Practically Efficient Computation
13 years 9 months ago
Abductive diagnosis is an important method to identify explanations for a given set of observations. Unfortunately, most of the algorithmic problems in this area are intractable. ...
BIRTHDAY
2010
Springer
13 years 10 months ago
2010
Springer
Given two strings, a pattern P of length m and a text T of length n over some alphabet of size , we consider the exact string matching problem, i.e. we want to report all occurren...
ISSAC
1995
Springer
13 years 11 months ago
1995
Springer
We present an efficient algorithm for testing whether a given integral polynomial has two distinct roots a, B such that fflp is a root of unity. The test is based on results obtai...
CIAC
2000
Springer
13 years 11 months ago
2000
Springer
We present an efficient algorithm for the approximate median selection problem. The algorithm works in-place; it is fast and easy to implement. For a large array it returns, with ...
CODES
2006
IEEE
13 years 11 months ago
2006
IEEE
In this paper, we present a general and an efficient algorithm for automatic selection of new application-specific instructions under hardware resources constraints. The instructi...
ATVA
2006
Springer
13 years 11 months ago
2006
Springer
Motivated by recent applications of pushdown systems to computer security problems, we present an efficient algorithm for the reachability problem of alternating pushdown systems. ...
VLDB
1990
ACM
13 years 11 months ago
1990
ACM
In this paper, we present an efficient algorithm for managing replicated data. We impose a logical tree structure on the set of copies of an object. In a failurefree environment t...
ICTAI
1996
IEEE
13 years 11 months ago
1996
IEEE
We present a mechanism for recovering consistent data from inconsistent set of assertions. For a common family of knowledge-bases we also provide an efficient algorithm for doing ...
IEEEPACT
1998
IEEE
13 years 11 months ago
1998
IEEE
In this paper, we present an efficient algorithm, called CASS-II, for task clustering without task duplication. Unlike the DSC algorithm, which is empirically the best known algor...
IDEAL
2004
Springer
14 years 24 days ago
2004
Springer
In this paper, we present PRICES, an efficient algorithm for mining association rules, which first identifies all large itemsets and then generates association rules. Our approach ...