813 search results - page 97 / 163 » On the Boolean-Width of a Graph: Structure and Applications |
ESWS
2010
Springer
14 years 1 months ago
2010
Springer
The performance of triple stores is one of the major obstacles for the deployment of semantic technologies in many usage scenarios. In particular, Semantic Web applications, which ...
INFOCOM
2005
IEEE
14 years 2 months ago
2005
IEEE
Abstract— Motivated by applications to sensor, peer-topeer and ad hoc networks, we study distributed asynchronous algorithms, also known as gossip algorithms, for computation and...
PPOPP
2009
ACM
14 years 9 months ago
2009
ACM
Irregular programs are programs organized around pointer-based data structures such as trees and graphs. Recent investigations by the Galois project have shown that many irregular...
PAMI
2008
13 years 9 months ago
2008
This paper presents a hierarchical-compositional model of human faces, as a three-layer AND-OR graph to account for the structural variabilities over multiple resolutions. In the A...
COMPGEOM
2004
ACM
14 years 2 months ago
2004
ACM
For a set S of points in Rd, an s-spanner is a graph on S such that any pair of points is connected via some path in the spanner whose total length is at most s times the Euclidea...