5055 search results - page 64 / 1011 » Relative Timing |
111
click to vote
DAM
2000
15 years 2 months ago
2000
The linear-width of a graph G is de ned to be the smallest integer k such that the edges of G can be arranged in a linear ordering e1;:::;er in such a way that for every i = 1;:::...
143
click to vote
AISS
2010
14 years 12 months ago
2010
A successful IT Company is characterized by its ability to put the right information in front of the right decision-makers at the right time while concerns about security issues. ...
159
click to vote
ALT
2011
Springer
14 years 2 months ago
2011
Springer
We consider the problem of learning sparse parities in the presence of noise. For learning parities on r out of n variables, we give an algorithm that runs in time poly log 1 δ , ...
179
Voted
MOBIHOC
2012
ACM
13 years 4 months ago
2012
ACM
With recent advances in Software-defined Radios (SDRs), it has indeed became feasible to dynamically adapt the channel widths at smaller time scales. Even though the advantages o...
122
click to vote
CSCLP
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. The union-find algorithm can be seen as solving simple equations between variables or constants. With a few lines of code change, we generalise its implementation in CHR...