Sciweavers

2767 search results - page 74 / 554
» Universal Exponentiation Algorithm
Sort
View
ESANN
2004
14 years 11 months ago
Input Space Bifurcation Manifolds of RNNs
We derive analytical expressions of local codim-1-bifurcations for a fully connected, additive, discrete-time RNN, where we regard the external inputs as bifurcation parameters. Th...
Robert Haschke, Jochen J. Steil
CORR
2008
Springer
58views Education» more  CORR 2008»
14 years 10 months ago
Tight Bounds on Minimum Maximum Pointwise Redundancy
This paper presents new lower and upper bounds for the optimal compression of binary prefix codes in terms of the most probable input symbol, where compression efficiency is determ...
Michael Baer
VISUALIZATION
2002
IEEE
15 years 2 months ago
Rendering The First Star In The Universe - A Case Study
For quantitative examination of phenomena that simultaneously occur on very different spatial and temporal scales, adaptive hierarchical schemes are required. A special numerical ...
Ralf Kähler, Donna Cox, Robert Patterson, Stu...
ALGOSENSORS
2009
Springer
14 years 7 months ago
Brief Announcement: Universal Data Aggregation Trees for Sensor Networks in Low Doubling Metrics
Abstract. We describe a novel approach for constructing a single spanning tree for data aggregation towards a sink node. The tree is universal in the sense that it is static and in...
Srinivasagopalan Srivathsan, Costas Busch, S. Sith...
CORR
2010
Springer
105views Education» more  CORR 2010»
14 years 4 months ago
Universal and Robust Distributed Network Codes
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...
Tracey Ho, Sidharth Jaggi, Svitlana Vyetrenko, Lin...