Sciweavers

7200 search results - page 41 / 1440
» On the Computational Power of Winner-Take-All
Sort
View
ACE
2004
171views Education» more  ACE 2004»
13 years 10 months ago
Teaching Computer Architecture in Introductory Computing: Why? and How?
This paper discusses our rationale for teaching the fundamentals of computer architecture early in the computer science (CS) degree program. We also describe an active learning te...
Kris D. Powers
FUIN
2006
90views more  FUIN 2006»
13 years 8 months ago
Local Computations in Graphs: The Case of Cellular Edge Local Computations
We examine the power and limitations of the weakest vertex relabelling system which allows to change a label of a vertex in function of its own label and of the label of one of its...
Jérémie Chalopin, Yves Métivi...
MSN
2007
Springer
14 years 2 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, ...
COMPUTER
2004
74views more  COMPUTER 2004»
13 years 8 months ago
WiseNET: An Ultralow-Power Wireless Sensor Network Solution
Christian C. Enz, Amre El-Hoiydi, Jean-Dominique D...
ARITH
2009
IEEE
14 years 3 months ago
Fast and Accurate Bessel Function Computation
The Bessel functions are considered relatively difficult to compute. Although they have a simple power series expansion that is everywhere convergent, they exhibit approximately ...
John Harrison