Sciweavers

840 search results - page 67 / 168
» The Complexity of the Extended GCD Problem
Sort
View
CI
2000
114views more  CI 2000»
13 years 7 months ago
A Guided Tour through Some Extensions of the Event Calculus
Kowalski and Sergot's Event Calculus (EC) is a simple temporal formalism that, given a set of event occurrences, derives the maximal validity intervals (MVIs) over which prop...
Iliano Cervesato, Massimo Franceschet, Angelo Mont...
ICPR
2004
IEEE
14 years 9 months ago
Bayesian Face Recognition Based on Gaussian Mixture Models
Bayesian analysis is a popular subspace based face recognition method. It casts the face recognition task into a binary classification problem with each of the two classes, intrap...
Xiaogang Wang, Xiaoou Tang
ICRA
2007
IEEE
122views Robotics» more  ICRA 2007»
14 years 2 months ago
Exploiting the Information at the Loop Closure in SLAM
— This paper presents two methods able to exploit the information at the loop closure in the SLAM problem. Both methods have three fundamental advantages. The first one is that ...
Agostino Martinelli, Roland Siegwart
PDP
2007
IEEE
14 years 2 months ago
Monitoring and Analysis Framework for Grid Middleware
As the use of complex grid middleware becomes widespread and more facilites are offered by these pieces of software, distributed Grid applications are becoming more and more popul...
Ramon Nou, Ferran Julià, David Carrera, Kev...
ISVLSI
2006
IEEE
89views VLSI» more  ISVLSI 2006»
14 years 1 months ago
System Exploration of SystemC Designs
Due to increasing design complexity new methodologies for system modeling have been established in VLSI CAD. The SystemC methodology gains a significant reduction of design cycle...
Christian Genz, Rolf Drechsler