Sciweavers

889 search results - page 70 / 178
» Problems in Rewriting III
Sort
View
CVPR
2009
IEEE
15 years 5 months ago
A Convex Relaxation Approach for Computing Minimal Partitions
In this work we propose a convex relaxation approach for computing minimal partitions. Our approach is based on rewriting the minimal partition problem (also known as Potts mode...
Thomas Pock (Graz University of Technology), Anton...
CAV
2009
Springer
212views Hardware» more  CAV 2009»
14 years 10 months ago
Beaver: Engineering an Efficient SMT Solver for Bit-Vector Arithmetic
We present the key ideas in the design and implementation of Beaver, an SMT solver for quantifier-free finite-precision bit-vector logic (QF BV). Beaver uses an eager approach, enc...
Susmit Jha, Rhishikesh Limaye, Sanjit A. Seshia
VLDB
2001
ACM
157views Database» more  VLDB 2001»
14 years 10 months ago
MiniCon: A scalable algorithm for answering queries using views
The problem of answering queries using views is to find efficient methods of answering a query using a set of previously materialized views over the database, rather than accessing...
Rachel Pottinger, Alon Y. Halevy
SIGMOD
2007
ACM
157views Database» more  SIGMOD 2007»
14 years 10 months ago
Compiling mappings to bridge applications and databases
Translating data and data access operations between applications and databases is a longstanding data management problem. We present a novel approach to this problem, in which the...
Sergey Melnik, Atul Adya, Philip A. Bernstein
FROCOS
2007
Springer
14 years 4 months ago
Towards an Automatic Analysis of Web Service Security
Web services send and receive messages in XML syntax with some parts hashed, encrypted or signed, according to the WS-Security standard. In this paper we introduce a model to forma...
Yannick Chevalier, Denis Lugiez, Michaël Rusi...