971 search results - page 84 / 195 » Approximate Satisfiability and Equivalence |
95
Voted
SG
2010
Springer
15 years 4 months ago
2010
Springer
Declarative approaches to camera control model inputs as properties on the camera and then rely on constraint-based and/or optimization techniques to compute the camera parameters ...
85
Voted
COMPGEOM
2008
ACM
15 years 2 months ago
2008
ACM
Given a fixed origin o in the d-dimensional grid, we give a novel definition of digital rays dig(op) from o to each grid point p. Each digital ray dig(op) approximates the Euclide...
CORR
2006
Springer
15 years 22 days ago
2006
Springer
The problem of discrete universal filtering, in which the components of a discrete signal emitted by an unknown source and corrupted by a known discrete memoryless channel (DMC) ar...
91
Voted
JCT
2010
14 years 11 months ago
2010
We show that for each η > 0 every digraph G of sufficiently large order n is Hamiltonian if its out- and indegree sequences d+ 1 ≤ · · · ≤ d+ n and d− 1 ≤ · · · â...
101
click to vote
FOCS
2006
IEEE
15 years 6 months ago
2006
IEEE
In this paper we present a new approximation algorithm for Unique Games. For a Unique Game with n vertices and k states (labels), if a (1 − ε) fraction of all constraints is sa...