Sciweavers

1089 search results - page 60 / 218
» Randomness and Reducibility
Sort
View
ICRA
2005
IEEE
114views Robotics» more  ICRA 2005»
14 years 2 months ago
Minimum Distance Localization for a Robot with Limited Visibility
— Minimum distance localization is the problem of finding the shortest possible path for a robot to eliminate ambiguity regarding its position in the environment. We consider th...
Malvika Rao, Gregory Dudek, Sue Whitesides
ANSS
2004
IEEE
14 years 24 days ago
Markov Model Based Congestion Control for TCP
The Random Early Detection (RED) scheme for congestion control in TCP is well known over a decade. Due to a number of control parameters in RED, it cannot make acceptable packet-d...
Shan Suthaharan
WAIFI
2007
Springer
110views Mathematics» more  WAIFI 2007»
14 years 3 months ago
On Kabatianskii-Krouk-Smeets Signatures
Kabastianskii, Krouk and Smeets proposed in 1997 a digital signature scheme based on random error-correcting codes. In this paper we investigate the security and the efficiency of ...
Pierre-Louis Cayrel, Ayoub Otmani, Damien Vergnaud
VMV
2004
123views Visualization» more  VMV 2004»
13 years 10 months ago
Hierarchy Accelerated Stochastic Collision Detection
In this paper we present a new framework for collision and self-collision detection for highly deformable objects such as cloth. It permits to efficiently trade off accuracy for s...
Stefan Kimmerle, Matthieu Nesme, François F...
CDES
2007
82views Hardware» more  CDES 2007»
13 years 10 months ago
Efficient Global Fault Collapsing for Combinational Library Modules
—Fault collapsing is the process of reducing the number of faults by using redundance and equivalence/dominance relationships among faults. Exact global fault collapsing can be e...
Hussain Al-Asaad