18090 search results - page 3214 / 3618 » Computing by Only Observing |
251
click to vote
ALGORITHMICA
2011
15 years 1 months ago
2011
Let G = (V, E, w) be a directed graph, where w : V → R is an arbitrary weight function defined on its vertices. The bottleneck weight, or the capacity, of a path is the smalles...
217
click to vote
COMCOM
2011
15 years 1 months ago
2011
In the very active field of complex networks, research advances have largely been stimulated by the availability of empirical data and the increase in computational power needed ...
190
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
In the algebraic theory of codes and formal languages, the set Q of all primitive words over some alphabet Σ has received special interest. With this survey article we give an ove...
203
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
Random linear network codes can be designed and implemented in a distributed manner, with low computational complexity. However, these codes are classically implemented [1] over fi...
229
click to vote
TASLP
2010
15 years 1 months ago
2010
Abstract-- In many research fields of engineering and acoustics, the image-source model represents one of the most popular tools for the simulation of sound fields in virtual rever...