Sciweavers

1242 search results - page 149 / 249
» The Theory of Grammar Constraints
Sort
View
131
Voted
ICDT
2012
ACM
251views Database» more  ICDT 2012»
13 years 3 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
115
Voted
STOC
2009
ACM
181views Algorithms» more  STOC 2009»
16 years 1 months ago
The detectability lemma and quantum gap amplification
The quantum analog of a constraint satisfaction problem is a sum of local Hamiltonians - each (term of the) Hamiltonian specifies a local constraint whose violation contributes to...
Dorit Aharonov, Itai Arad, Zeph Landau, Umesh V. V...
CADE
2005
Springer
16 years 1 months ago
An Algorithm for Deciding BAPA: Boolean Algebra with Presburger Arithmetic
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
Viktor Kuncak, Huu Hai Nguyen, Martin C. Rinard
83
Voted
MP
2007
76views more  MP 2007»
15 years 9 days ago
Universal duality in conic convex optimization
Given a primal-dual pair of linear programs, it is well known that if their optimal values are viewed as lying on the extended real line, then the duality gap is zero, unless both...
Simon P. Schurr, André L. Tits, Dianne P. O...
ECCV
2008
Springer
16 years 2 months ago
Shadows in Three-Source Photometric Stereo
Shadows are one of the most significant difficulties of the photometric stereo method. When four or more images are available, local surface orientation is overdetermined and the s...
Carlos Hernández, George Vogiatzis, Roberto...