Sciweavers

148 search results - page 19 / 30
» On the extender algebra being complete
Sort
View
ACTA
2007
85views more  ACTA 2007»
13 years 7 months ago
The complexity of satisfying constraints on databases of transactions
Abstract Computing frequent itemsets is one of the most prominent problems in data mining. Recently, a new related problem, called FREQSAT, was introduced and studied: given some i...
Toon Calders
COMMA
2006
13 years 9 months ago
A dialectic procedure for sceptical, assumption-based argumentation
We present a procedure for computing the sceptical "ideal semantics" for argumentation in assumption-based frameworks. This semantics was first proposed for logic program...
Phan Minh Dung, Paolo Mancarella, Francesca Toni
APPROX
2009
Springer
136views Algorithms» more  APPROX 2009»
14 years 2 months ago
Succinct Representation of Codes with Applications to Testing
Motivated by questions in property testing, we search for linear error-correcting codes that have the “single local orbit” property: i.e., they are specified by a single loca...
Elena Grigorescu, Tali Kaufman, Madhu Sudan
IJCNN
2008
IEEE
14 years 2 months ago
A pragmatic path toward endowing virtually-embodied AIs with human-level linguistic capability
— Current work is described wherein simplified versions of the Novamente Cognition Engine (NCE) are being used to control virtual agents in virtual worlds such as game engines an...
Ben Goertzel
BNCOD
2003
91views Database» more  BNCOD 2003»
13 years 9 months ago
Persistent Indexing Technology for Large Sequences
There are two aspects to the work being presented here. The first is a novel persistent index structure for genomic data, a prototype of which has been completed. The second, usin...
Robert Japp