Sciweavers

1453 search results - page 242 / 291
» Partial Constraint Satisfaction
Sort
View
141
Voted
WDAG
2010
Springer
196views Algorithms» more  WDAG 2010»
15 years 2 months ago
Brief Announcement: Failure Detectors Encapsulate Fairness
Abstract. We argue that failure detectors encapsulate fairness. Fairness is a measure of the number of steps a process takes relative to another processes and/or messages in transi...
Scott M. Pike, Srikanth Sastry, Jennifer L. Welch
ICIP
2005
IEEE
16 years 5 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 4 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 4 months 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
TCC
2009
Springer
169views Cryptology» more  TCC 2009»
16 years 4 months ago
Goldreich's One-Way Function Candidate and Myopic Backtracking Algorithms
Abstract. Goldreich (ECCC 2000) proposed a candidate one-way function construction which is parameterized by the choice of a small predicate (over d = O(1) variables) and of a bipa...
James Cook, Omid Etesami, Rachel Miller, Luca Trev...