Sciweavers

5539 search results - page 42 / 1108
» What can be computed locally
Sort
View
ICCNMC
2005
Springer
14 years 3 months ago
Least Cost Multicast Spanning Tree Algorithm for Local Computer Network
This study deals with the topology discovery for the capacitated minimum spanning tree network. The problem is composed of finding the best way to link nodes to a source node and, ...
Yong-Jin Lee, Mohammed Atiquzzaman
DIS
2007
Springer
14 years 4 months ago
Computational Discovery in Pure Mathematics
Abstract. We discuss what constitutes knowledge in pure mathematics and how new advances are made and communicated. We describe the impact of computer algebra systems, automated th...
Simon Colton
ICANN
2007
Springer
14 years 4 months ago
Event Detection and Localization in Mobile Robot Navigation Using Reservoir Computing
Abstract. Reservoir Computing (RC) uses a randomly created recurrent neural network where only a linear readout layer is trained. In this work, RC is used for detecting complex eve...
Eric A. Antonelo, Benjamin Schrauwen, Xavier Dutoi...
MOBIHOC
2009
ACM
14 years 10 months ago
Aging rules: what does the past tell about the future in mobile ad-hoc networks?
The study in mobile ad-hoc networks (MANET) is facing challenges brought by recent discovery of non-exponential behavior of the inter-contact time distribution of mobile nodes. In...
Han Cai, Do Young Eun
SIGMOD
2009
ACM
157views Database» more  SIGMOD 2009»
14 years 10 months ago
FPGA: what's in it for a database?
While there seems to be a general agreement that next years' systems will include many processing cores, it is often overlooked that these systems will also include an increa...
Jens Teubner, René Müller