Sciweavers

4451 search results - page 124 / 891
» On Random Ordering Constraints
Sort
View
DCG
2007
94views more  DCG 2007»
15 years 4 months ago
Banach-Mazur Distances and Projections on Random Subgaussian Polytopes
We consider polytopes in Rn that are generated by N vectors in Rn whose coordinates are independent subgaussian random variables. (A particular case of such polytopes are symmetri...
Rafal Latala, Piotr Mankiewicz, Krzysztof Oleszkie...
ICASSP
2011
IEEE
14 years 8 months ago
Generalized Restricted Isometry Property for alpha-stable random projections
The Restricted Isometry Property (RIP) is an important concept in compressed sensing. It is well known that many random matrices satisfy the RIP with high probability, whenever th...
Daniel Otero, Gonzalo R. Arce
SARA
2007
Springer
15 years 10 months ago
Tailoring Solver-Independent Constraint Models: A Case Study with Essence' and Minion
In order to apply constraint programming to a particular domain, the problem must first be modelled as a constraint satisfaction problem. There are typically many alternative mode...
Ian P. Gent, Ian Miguel, Andrea Rendl
SAGA
2001
Springer
15 years 9 months ago
Yet Another Local Search Method for Constraint Solving
We propose a generic, domain-independent local search method called adaptive search for solving Constraint Satisfaction Problems (CSP). We design a new heuristics that takes advan...
Philippe Codognet, Daniel Diaz
CP
2008
Springer
15 years 6 months ago
Classes of Submodular Constraints Expressible by Graph Cuts
Submodular constraints play an important role both in theory and practice of valued constraint satisfaction problems (VCSPs). It has previously been shown, using results from the ...
Stanislav Zivný, Peter Jeavons