2485 search results - page 80 / 497 » Time Bounded Frequency Computations |
122
click to vote
FOCS
2008
IEEE
15 years 11 months ago
2008
IEEE
We present a distributed clock synchronization algorithm that guarantees an exponentially improved bound of O(log D) on the clock skew between neighboring nodes in any graph G of ...
142
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...
112
click to vote
OOPSLA
2010
Springer
15 years 2 months ago
2010
Springer
The act of computer programming is generally considered to be temporally removed from a computer program’s execution. In this paper we discuss the idea of programming as an acti...
125
click to vote
MFCS
1995
Springer
15 years 8 months ago
1995
Springer
The graph inference from a walk for a class C of undirected edge-colored graphs is, given a string x of colors, nding the smallest graph G in C that allows a traverse of all edge...
140
click to vote
ICPR
2010
IEEE
15 years 2 months ago
2010
IEEE
To classify spectroscopic measurements it is necessary to have comparable methods of evaluation. In Terahertz (THz) time-domain spectroscopy, as a new technology, neither the pres...