813 search results - page 59 / 163 » On the Boolean-Width of a Graph: Structure and Applications |
CANDT
2009
14 years 1 months ago
2009
Self-focus is a novel way of understanding a type of bias in community-maintained Web 2.0 graph structures. It goes beyond previous measures of topical coverage bias by encapsulat...
POPL
1997
ACM
14 years 1 months ago
1997
ACM
Type systems currently available for imperative languages are too weak to detect a significant class of programming errors. For example, they cannot express the property that a l...
CACM
1998
13 years 9 months ago
1998
abstraction for modeling these problems is to view the Web as a collection of (usually small and heterogeneous) databases, and to view programs that extract and process Web data au...
LCTRTS
2007
Springer
14 years 3 months ago
2007
Springer
Existing methods place data or code in scratchpad memory, i.e., SPM by either relying on heuristics or resorting to integer programming or mapping it to a graph coloring problem. ...
ER
2004
Springer
14 years 2 months ago
2004
Springer
Our goal is to model the way people induce knowledge from rare and sparse data. This paper describes a theoretical framework for inducing knowledge from these incomplete data descr...