IJRR
2002
13 years 11 months ago
2002
: This paper describes the foundations and algorithms of a new probabilistic roadmap (PRM) planner that is: single-query
VC
2008
13 years 11 months ago
2008
Animation authoring involves an author's interaction with a scene, resulting in varying scene complexity for a given animation sequence. In such a varying environment, detecti...
TSP
2008
13 years 11 months ago
2008
A random access protocol named ALLIANCES was recently proposed, that achieves high throughput by resolving collisions in wireless networks. ALLIANCES exploits diversity provided b...
CG
2006
Springer
13 years 11 months ago
2006
Springer
In this paper we consider the novel idea of closest feature maps (CFMs) applied to refinable collision response in order to address the potential issues and problems associated wi...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
In sensor networks communication by broadcast methods involves many hazards, especially collision. Several MAC layer protocols have been proposed to resolve the problem of collisi...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
Current medium access control mechanisms are based on collision avoidance and collided packets are discarded. The recent work on ZigZag decoding departs from this approach by recov...
ALIFE
2007
13 years 11 months ago
2007
: Reliably recognizing objects approaching on a collision course is extremely important. In this paper, a synthetic vision system is proposed to tackle the problem of collision rec...
MOBICOM
2010
ACM
13 years 11 months ago
2010
ACM
A wireless transmitter learns of a packet loss, infers collision, only after completing the entire transmission. If the transmitter could detect the collision early (such as with ...
VMV
2004
14 years 27 days ago
2004
This paper presents an approach to collision detection and response for dynamically deforming pointbased objects. Both the volume of an object and its surface are represented by p...
FSE
2008
Springer
14 years 1 months ago
2008
Springer
In this article we find collisions for step-reduced SHA-256. We develop a differential that holds with high probability if the message satisfies certain conditions. We solve the eq...