Sciweavers

2520 search results - page 73 / 504
» The complexity of approximating entropy
Sort
View
IVEVA
2004
14 years 11 months ago
Characterising Emotion Signalling and Affected Group Behaviour in Virtual Mammals
This paper investigates how emotions, in this case fear, affect behaviour. We consider deer and sheep as exemplary flocking mammals. The paper also describes and applies a mechanis...
Carlos Delgado-Mata
ADCM
2004
58views more  ADCM 2004»
14 years 10 months ago
On the Representation of Band-Dominant Functions on the Sphere Using Finitely Many Bits
A band-dominant function on the Euclidean sphere embedded in Rq+1 is the restriction to this sphere of an entire function of q + 1 complex variables having a finite exponential ty...
Hrushikesh Narhar Mhaskar, Francis J. Narcowich, J...
WINET
2002
103views more  WINET 2002»
14 years 9 months ago
LeZi-Update: An Information-Theoretic Framework for Personal Mobility Tracking in PCS Networks
The complexity of the mobility tracking problem in a cellular environment has been characterized under an information-theoretic framework. Shannon's entropy measure is identif...
Amiya Bhattacharya, Sajal K. Das
ICC
2009
IEEE
144views Communications» more  ICC 2009»
15 years 4 months ago
Capacity of Optical Intensity Channels with Peak and Average Power Constraints
— The design and analysis of capacity-approaching input signalling for optical intensity channels are presented. Both peak and average optical power constraints are considered in...
Ahmed A. Farid, Steve Hranilovic
DAC
1996
ACM
15 years 2 months ago
Efficient Approximation Algorithms for Floorplan Area Minimization
Approximation has been shown to be an eective method for reducing the time and space costs of solving various oorplan area minimization problems. In this paper, we present several...
Danny Z. Chen, Xiaobo Hu