Sciweavers

706 search results - page 83 / 142
» An Integer Linear Programming Approach to Database Design
Sort
View
CODES
2005
IEEE
15 years 4 months ago
Satisfying real-time constraints with custom instructions
Instruction-set extensible processors allow an existing processor core to be extended with application-specific custom instructions. In this paper, we explore a novel application...
Pan Yu, Tulika Mitra
CAV
2012
Springer
227views Hardware» more  CAV 2012»
13 years 1 months ago
Minimum Satisfying Assignments for SMT
Abstract. A minimum satisfying assignment of a formula is a minimumcost partial assignment of values to the variables in the formula that guarantees the formula is true. Minimum sa...
Isil Dillig, Thomas Dillig, Kenneth L. McMillan, A...
VLDB
2002
ACM
151views Database» more  VLDB 2002»
14 years 10 months ago
Preference SQL - Design, Implementation, Experiences
Current search engines can hardly cope adequately with fuzzy predicates defined by complex preferences. The biggest problem of search engines implemented with standard SQL is that...
Werner Kießling, Gerhard Köstler
CORR
2010
Springer
157views Education» more  CORR 2010»
14 years 9 months ago
Active Integrity Constraints and Revision Programming
We study active integrity constraints and revision programming, two formalisms designed to describe integrity constraints on databases and to specify policies on preferred ways to...
Luciano Caroprese, Miroslaw Truszczynski
STOC
1998
ACM
139views Algorithms» more  STOC 1998»
15 years 3 months ago
Analysis of Low Density Codes and Improved Designs Using Irregular Graphs
In [6], Gallager introduces a family of codes based on sparse bipartite graphs, which he calls low-density parity-check codes. He suggests a natural decoding algorithm for these c...
Michael Luby, Michael Mitzenmacher, Mohammad Amin ...