1017 search results - page 58 / 204 » On the Power of k -Consistency |
145
click to vote
PODC
2010
ACM
15 years 10 months ago
2010
ACM
: The Borowsky-Gafni (BG) simulation algorithm is a powerful reduction algorithm that shows that t-resilience of decision tasks can be fully characterized in terms of wait-freedom....
141
click to vote
ASPDAC
2007
ACM
15 years 10 months ago
2007
ACM
- This paper covers a multi-functional hardware intellectual property (IP) for the encoding and decoding of digital moving pictures with low power consumption. The IP is mainly int...
212
click to vote
CHI
2002
ACM
16 years 6 months ago
2002
ACM
The Special Interest Group on Computer Human Interaction (SIGCHI) has had a successful history of 20 years of growth in its numbers and influence. To help guide the continued evol...
153
click to vote
ESA
2007
Springer
16 years 10 days ago
2007
Springer
Given a graph G = (V, E), a (d, k)-coloring is a function from the vertices V to colors {1, 2, . . . , k} such that any two vertices within distance d of each other are assigned di...
178
click to vote
ECCC
2010
15 years 4 months ago
2010
Bodlaender’s Theorem states that for every k there is a linear-time algorithm that decides whether an input graph has tree width k and, if so, computes a width-k tree compositio...