316 search results - page 36 / 64 » On Approximate Majority and Probabilistic Time |
101
click to vote
ICRA
2002
IEEE
15 years 2 months ago
2002
IEEE
:This paper presents a trajectory planning algorithm for mobile robots which may be subject to kinodynamic constraints. Using computational methods from noncommutative harmonic ana...
71
Voted
ANCS
2008
ACM
14 years 11 months ago
2008
ACM
Time-sensitive network experiments are difficult. There are major challenges involved in generating high volumes of sufficiently realistic traffic. Additionally, accurately measur...
74
Voted
TGC
2007
Springer
15 years 3 months ago
2007
Springer
Secure information flow analysis aims to prevent programs from leaking their H (high) inputs to their L (low) outputs. A major challenge in this area is to relax the standard noni...
102
click to vote
BCB
2010
14 years 4 months ago
2010
A major bottleneck in high-throughput protein crystallography is producing protein-structure models from an electrondensity map. In previous work, we developed Acmi, a probabilist...
ICCV
2003
IEEE
15 years 11 months ago
2003
IEEE
A new method for visual tracking of articulated objects is presented. Analyzing articulated motion is challenging because the dimensionality increase potentially demands tremendou...