Sciweavers

5580 search results - page 257 / 1116
» Randomized priority algorithms
Sort
View
ICITS
2009
15 years 4 months ago
On the Security of Pseudorandomized Information-Theoretically Secure Schemes
In this article, we discuss a naive method of randomness reduction for cryptographic schemes, which replaces the required perfect randomness with output distribution of a computat...
Koji Nuida, Goichiro Hanaoka
ESA
2009
Springer
120views Algorithms» more  ESA 2009»
16 years 28 days ago
Rank-Pairing Heaps
Abstract. We introduce the rank-pairing heap, a heap (priority queue) implementation that combines the asymptotic efficiency of Fibonacci heaps with much of the simplicity of pair...
Bernhard Haeupler, Siddhartha Sen, Robert Endre Ta...
IROS
2007
IEEE
126views Robotics» more  IROS 2007»
16 years 19 days ago
Development of a contact interaction-based navigation strategy for a biped humanoid robot
— This paper presents the development of a contact interaction-based navigation strategy for a biped humanoid robot with the aim of supporting current visual-based navigation. Th...
Hanafiah B. Yussof, Mitsuhiro Yamano, Masahiro Ohk...
SBACPAD
2007
IEEE
130views Hardware» more  SBACPAD 2007»
16 years 19 days ago
Design of a Feasible On-Chip Interconnection Network for a Chip Multiprocessor (CMP)
In this paper, an adaptive wormhole router for a flexible on-chip interconnection network is proposed and implemented for a Chip-Multi Processor (CMP). It adopts a wormhole switc...
Seung Eun Lee, Jun Ho Bahn, Nader Bagherzadeh
171
Voted
ICMCS
2006
IEEE
192views Multimedia» more  ICMCS 2006»
16 years 11 days ago
Low Latency Video Streaming Over Peer-To-Peer Networks
We study peer-to-peer multicast streaming, where a source distributes real-time video to a large population of hosts by making use of their forwarding capacity rather than relying...
Eric Setton, Jeonghun Noh, Bernd Girod