Sciweavers

19320 search results - page 412 / 3864
» On the complexity of computing determinants
Sort
View
173
Voted
ICRA
2006
IEEE
137views Robotics» more  ICRA 2006»
16 years 27 days ago
Using Multi-hypothesis Mapping to close Loops in Complex Cyclic Environments
— This paper describes an off-line, iterative algorithm for simultaneous localization and mapping within large indoor environments. The proposed approach is based on the idea of ...
Haris Baltzakis, Panos E. Trahanias
179
Voted
ACMSE
2006
ACM
16 years 25 days ago
Discovering communities in complex networks
We propose an efficient and novel approach for discovering communities in real-world random networks. Communities are formed by subsets of nodes in a graph, which are closely rela...
Hemant Balakrishnan, Narsingh Deo
FSTTCS
2004
Springer
16 years 7 days ago
Hardness Hypotheses, Derandomization, and Circuit Complexity
We consider hypotheses about nondeterministic computation that have been studied in different contexts and shown to have interesting consequences: • The measure hypothesis: NP d...
John M. Hitchcock, Aduri Pavan
242
Voted
IWCM
2004
Springer
16 years 7 days ago
Tracking Complex Objects Using Graphical Object Models
We present a probabilistic framework for component-based automatic detection and tracking of objects in video. We represent objects as spatio-temporal two-layer graphical models, w...
Leonid Sigal, Ying Zhu, Dorin Comaniciu, Michael J...
ICDCS
2002
IEEE
15 years 11 months ago
The Complexity of Adding Failsafe Fault-Tolerance
In this paper, we focus our attention on the problem of automating the addition of failsafe fault-tolerance where fault-tolerance is added to an existing (fault-intolerant) progra...
Sandeep S. Kulkarni, Ali Ebnenasir