Sciweavers

34 search results - page 5 / 7
» Random Constraint Satisfaction: Theory Meets Practice
Sort
View
ICC
2007
IEEE
14 years 1 months ago
Robust Multibeam Opportunistic Schemes Under Quality of Service Constraints
— Scheduling in a Broadcast (BC) channel based on partial Channel State Information at the Transmitter (CSIT) is carried out in an opportunistic way, where several orthogonal bea...
Nizar Zorba, Ana I. Pérez-Neira
IUI
2004
ACM
14 years 27 days ago
SUPPLE: automatically generating user interfaces
In order to give people ubiquitous access to software applications, device controllers, and Internet services, it will be necessary to automatically adapt user interfaces to the c...
Krzysztof Gajos, Daniel S. Weld
CP
2007
Springer
14 years 1 months ago
Breaking Value Symmetry
Symmetry is an important factor in solving many constraint satisfaction problems. One common type of symmetry is when we have symmetric values. We can eliminate such value symmetr...
Toby Walsh
KDD
2003
ACM
124views Data Mining» more  KDD 2003»
14 years 7 months ago
Information-theoretic co-clustering
Two-dimensional contingency or co-occurrence tables arise frequently in important applications such as text, web-log and market-basket data analysis. A basic problem in contingenc...
Inderjit S. Dhillon, Subramanyam Mallela, Dharmend...
STOC
2009
ACM
181views Algorithms» more  STOC 2009»
14 years 8 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...