4451 search results - page 385 / 891 » On Random Ordering Constraints |
213
click to vote
OL
2011
14 years 9 months ago
2011
In this paper we present a methodology for finding tight convex relaxations for a special set of quadratic constraints given by bilinear and linear terms that frequently arise in ...
198
click to vote
DAWAK
2011
Springer
14 years 6 months ago
2011
Springer
Data cleaning and ETL processes are usually modeled as graphs of data transformations. The involvement of the users responsible for executing these graphs over real data is importa...
194
click to vote
ICIP
2003
IEEE
16 years 8 months ago
2003
IEEE
This paperpresentsa novel framework for streamingvideo over a Differentiated Services (DifPjew) network that jointly considers video source coding. packet classification and error...
186
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
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...
188
click to vote
STOC
2004
ACM
16 years 7 months ago
2004
ACM
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...