459 search results - page 87 / 92 » Computational Complexity of Probabilistic Disambiguation |
PDCAT
2005
Springer
15 years 3 months ago
2005
Springer
Recently a bulk of research [14, 5, 15, 9] has been done on the modelling of the smallworld phenomenon, which has been shown to be pervasive in social and nature networks, and eng...
83
Voted
IBPRIA
2003
Springer
15 years 2 months ago
2003
Springer
In this paper we present an environment for the tracking of a human face obtained from a real video sequence. We will describe the system and discuss the advantages and disadvanta...
101
Voted
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...
100
click to vote
FOCS
1999
IEEE
15 years 1 months ago
1999
IEEE
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...
EVOW
2007
Springer
15 years 1 months ago
2007
Springer
RND (Radio Network Design) is a Telecommunication problem consisting in covering a certain geographical area by using the smallest number of radio antennas achieving the biggest co...