Sciweavers

614 search results - page 15 / 123
» Computational Complexity of Multi-way, Dataflow Constraint P...
Sort
View
SSDBM
2003
IEEE
96views Database» more  SSDBM 2003»
14 years 1 months ago
Space Constrained Selection Problems for Data Warehouses and Pervasive Computing
Space constrained optimization problems arise in a multitude of important applications such as data warehouses and pervasive computing. A typical instance of such problems is to s...
Themistoklis Palpanas, Nick Koudas, Alberto O. Men...
EMMCVPR
2001
Springer
14 years 8 days ago
Estimation of Distribution Algorithms: A New Evolutionary Computation Approach for Graph Matching Problems
The interest of graph matching techniques in the pattern recognition field is increasing due to the versatility of representing knowledge in the form of graphs. However, the size ...
Endika Bengoetxea, Pedro Larrañaga, Isabell...
TDSC
2008
125views more  TDSC 2008»
13 years 7 months ago
Trustworthy Computing under Resource Constraints with the DOWN Policy
Trustworthy computing modules like secure coprocessors (ScP) are already in extensive use today, albeit limited predominantly to scenarios where constraints on cost is not a seriou...
Mahalingam Ramkumar
ICDT
2012
ACM
251views Database» more  ICDT 2012»
11 years 10 months ago
Computing universal models under guarded TGDs
A universal model of a database D and a set Σ of integrity constraints is a database that extends D, satisfies Σ, and is most general in the sense that it contains sound and co...
André Hernich
STACS
2010
Springer
14 years 2 months ago
The Complexity of Approximating Bounded-Degree Boolean #CSP
The degree of a CSP instance is the maximum number of times that a variable may appear in the scope of constraints. We consider the approximate counting problem for Boolean CSPs wi...
Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsen...