4865 search results - page 216 / 973 » The Complexity of Graph Connectivity |
139
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
Randomness extraction is the process of constructing a source of randomness of high quality from one or several sources of randomness of lower quality. The problem can be modeled ...
149
Voted
COMSWARE
2006
IEEE
15 years 10 months ago
2006
IEEE
— Development in new radio technologies and increase in user demands are driving the deployment of a wide array of wireless networks, ranging from 802.11 networks in the local ar...
125
click to vote
CATS
2008
15 years 5 months ago
2008
We study the consistency problem for extended global cardinality (EGC) constraints. An EGC constraint consists of a set X of variables, a set D of values, a domain D(x) D for eac...
163
click to vote
SODA
1992
ACM
15 years 5 months ago
1992
ACM
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...
167
click to vote
SOFTVIS
2010
ACM
15 years 4 months ago
2010
ACM
Understanding the data structures in a program is crucial to understanding how the program works, or why it doesn't work. Inspecting the code that implements the data structu...