Sciweavers

4372 search results - page 505 / 875
» Algorithmic Theories of Everything
Sort
View
CORR
2011
Springer
215views Education» more  CORR 2011»
15 years 1 months ago
The total path length of split trees
We consider the model of random trees introduced by Devroye [SIAM J Comput 28, 409– 432, 1998]. The model encompasses many important randomized algorithms and data structures. T...
Nicolas Broutin, Cecilia Holmgren
278
Voted
ICASSP
2011
IEEE
14 years 10 months ago
Analysis of the security of linear blinding techniques from an information theoretical point of view
We propose a novel model to characterize the security of linear blinding techniques. The proposed model relates the security of blinding to the possibility of estimating the blind...
Tiziano Bianchi, Alessandro Piva, Mauro Barni
212
Voted
JSAC
2011
100views more  JSAC 2011»
14 years 9 months ago
Scheduling for Optimal Rate Allocation in Ad Hoc Networks With Heterogeneous Delay Constraints
—This paper studies the problem of scheduling in single-hop wireless networks with real-time traffic, where every packet arrival has an associated deadline and a minimum fractio...
Juan José Jaramillo, R. Srikant, Lei Ying
ATAL
2011
Springer
14 years 6 months ago
Human-like memory retrieval mechanisms for social companions
This paper demonstrates a biologically- and psychologicallyinspired human-like computational memory focusing on the retrieval mechanisms – Spreading Activation and Compound Cue ...
Mei Yii Lim, Ruth Aylett, Patrícia Amâ...
ATAL
2011
Springer
14 years 6 months ago
Forgetting through generalisation: a companion with selective memory
This research investigates event generalisation in computational episodic memory for artificial companions. Two studies indicated a preference of a biologically-inspired selectiv...
Mei Yii Lim, Ruth Aylett, Patrícia Amâ...