Sciweavers

1487 search results - page 64 / 298
» The Computational Complexity of Link Building
Sort
View
TON
2002
138views more  TON 2002»
15 years 1 months ago
Algebra and algorithms for QoS path computation and hop-by-hop routing in the internet
Prompted by the advent of quality-of-service routing in the Internet, we investigate the properties that path weight functions must have so that hop-by-hop routing is possible and ...
João L. Sobrinho
ISBI
2011
IEEE
14 years 5 months ago
Sparse topological data recovery in medical images
For medical image analysis, the test statistic of the measurements is usually constructed at every voxels in space and thresholded to determine the regions of significant signals...
Moo K. Chung, Hyekyoung Lee, Peter T. Kim, Jong Ch...
NGC
2010
Springer
183views Communications» more  NGC 2010»
14 years 8 months ago
Brain-like Computing Based on Distributed Representations and Neurodynamics
A key to overcoming the limitations of classical artificial intelligence and to deal well with enormous amounts of information might be brain-like computing in which distributed re...
Ken Yamane, Masahiko Morita
MSN
2007
Springer
15 years 7 months ago
Distributed Computation of Maximum Lifetime Spanning Subgraphs in Sensor Networks
Abstract. We present a simple and efficient distributed method for determining the transmission power assignment that maximises the lifetime of a data-gathering wireless sensor net...
Harri Haanpää, André Schumacher, ...
DEBS
2009
ACM
15 years 8 months ago
Soft state in publish/subscribe
Building survivable content-based publish/subscribe systems is difficult. Every node in a distributed publish/subscribe system stores a significant amount of routing state which ...
Zbigniew Jerzak, Christof Fetzer