Sciweavers

1274 search results - page 151 / 255
» Graph lambda theories
Sort
View
WWW
2010
ACM
14 years 2 months ago
RDF compression: basic approaches
This paper studies the compressibility of RDF data sets. We show that big RDF data sets are highly compressible due to the structure of RDF graphs (power law), organization of URI...
Javier D. Fernández, Claudio Gutierrez, Mig...
ICIP
1998
IEEE
14 years 1 months ago
Segmentation as a Riemannian Drum Problem
1 In this paper, the segmentation problem is formulated as a problem of segmenting a Riemannian manifold. The image domain is endowed with an anisotropic metric and its segmentatio...
Jayant Shah
FOCS
1997
IEEE
14 years 1 months ago
Storage Management for Evolving Databases
The problem of maintaining data that arrives continuously over time is increasingly prevalent in databases and digital libraries. Building on a model for sliding-window indices de...
Jon M. Kleinberg, Rajeev Motwani, Prabhakar Raghav...
BPM
2006
Springer
206views Business» more  BPM 2006»
14 years 26 days ago
A Discourse on Complexity of Process Models
Complexity has undesirable effects on, among others, the correctness, maintainability, and understandability of business process models. Yet, measuring complexity of business proce...
Jorge Cardoso, Jan Mendling, Gustaf Neumann, Hajo ...
CPAIOR
2006
Springer
14 years 26 days ago
Improved Algorithm for the Soft Global Cardinality Constraint
Abstract. We propose two algorithms achieving generalized arc consistency for the soft global cardinality constraint with variable-based violation and with value-based violation. T...
Alessandro Zanarini, Michela Milano, Gilles Pesant