Sciweavers

1243 search results - page 147 / 249
» On the locality of bounded growth
Sort
View
CN
2007
116views more  CN 2007»
15 years 6 months ago
Scalability and security in biased many-to-one communication
In multicast communication, a source transmits the same content to a set of receivers. Current protocols for multicast follow a tree communication model which makes them scalable....
Francesc Sebé, Josep Domingo-Ferrer
IAT
2009
IEEE
16 years 1 months ago
Cluster-Swap: A Distributed K-median Algorithm for Sensor Networks
In building practical sensor networks, it is often beneficial to use only a subset of sensors to take measurements because of computational, communication, and power limitations....
Yoonheui Kim, Victor R. Lesser, Deepak Ganesan, Ra...
BILDMED
2007
112views Algorithms» more  BILDMED 2007»
15 years 8 months ago
Fully-Automatic Correction of the Erroneous Border Areas of an Aneurysm
Abstract. Volume representations of blood vessels acquired by 3D rotational angiography are very suitable for diagnosing an aneurysm. We presented a fully-automatic aneurysm labell...
Jan Bruijns, Frans J. Peters, Robert-Paul Berretty...
ICML
2000
IEEE
16 years 7 months ago
Rates of Convergence for Variable Resolution Schemes in Optimal Control
This paper presents a general method to derive tight rates of convergence for numerical approximations in optimal control when we consider variable resolution grids. We study the ...
Andrew W. Moore, Rémi Munos
CORR
2011
Springer
138views Education» more  CORR 2011»
15 years 1 months ago
On the resilience of Hamiltonicity and optimal packing of Hamilton cycles in random graphs
Let k = (k1, . . . , kn) be a sequence of n integers. For an increasing monotone graph property P we say that a base graph G = ([n], E) is k-resilient with respect to P if for eve...
Sonny Ben-Shimon, Michael Krivelevich, Benny Sudak...