Sciweavers

130 search results - page 20 / 26
» The Language Theory of Bounded Context-Switching
Sort
View
POPL
2008
ACM
14 years 7 months ago
Imperative self-adjusting computation
Self-adjusting computation enables writing programs that can automatically and efficiently respond to changes to their data (e.g., inputs). The idea behind the approach is to stor...
Umut A. Acar, Amal Ahmed, Matthias Blume
KDD
2009
ACM
202views Data Mining» more  KDD 2009»
14 years 8 months ago
Correlated itemset mining in ROC space: a constraint programming approach
Correlated or discriminative pattern mining is concerned with finding the highest scoring patterns w.r.t. a correlation measure (such as information gain). By reinterpreting corre...
Siegfried Nijssen, Tias Guns, Luc De Raedt
DALT
2005
Springer
14 years 28 days ago
Complete Axiomatizations of Finite Syntactic Epistemic States
An agent who bases his actions upon explicit logical formulae has at any given point in time a finite set of formulae he has computed. Closure or consistency conditions on this se...
Thomas Ågotnes, Michal Walicki
ISMIS
2003
Springer
14 years 18 days ago
Classifying Document Titles Based on Information Inference
We propose an intelligent document title classification agent based on a theory of information inference. The information is represented as vectorial spaces computed by a cognitive...
Dawei Song, Peter Bruza, Zi Huang, Raymond Y. K. L...
COMPGEOM
2010
ACM
14 years 14 days ago
Output-sensitive algorithm for the edge-width of an embedded graph
Let G be an unweighted graph of complexity n cellularly embedded in a surface (orientable or not) of genus g. We describe improved algorithms to compute (the length of) a shortest...
Sergio Cabello, Éric Colin de Verdiè...