Sciweavers

1051 search results - page 194 / 211
» Foundations of Constraint Satisfaction
Sort
View
ICIP
2005
IEEE
16 years 2 months ago
Color signal decomposition method using 3-D Gamut boundary of multi-primary display
Color signal decomposition method is to decompose the conventional three-primary colors(RGB) into the multiprimary control values of multi-primary display(MPD) under the constraint...
Dong-Woo Kang, Yang-Ho Cho, Myong-Young Lee, Tae-Y...
STOC
2009
ACM
160views Algorithms» more  STOC 2009»
16 years 1 months ago
CSP gaps and reductions in the lasserre hierarchy
We study integrality gaps for SDP relaxations of constraint satisfaction problems, in the hierarchy of SDPs defined by Lasserre. Schoenebeck [25] recently showed the first integra...
Madhur Tulsiani
CHI
2009
ACM
16 years 29 days ago
Aesthetics matter: leveraging design heuristics to synthesize visually satisfying handheld interfaces
We present a tool for automatically generating UI layouts for handheld devices based on design principles. This tool introduces a gestalt approach to visual interface design rathe...
Yeonsoo Yang, Scott R. Klemmer
PODS
2007
ACM
159views Database» more  PODS 2007»
16 years 15 days ago
Generalized hypertree decompositions: np-hardness and tractable variants
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
Georg Gottlob, Thomas Schwentick, Zoltán Mi...
WISEC
2009
ACM
15 years 7 months ago
Towards a theory for securing time synchronization in wireless sensor networks
Time synchronization in highly distributed wireless systems like sensor and ad hoc networks is extremely important in order to maintain a consistent notion of time throughout the ...
Murtuza Jadliwala, Qi Duan, Shambhu J. Upadhyaya, ...