588 search results - page 41 / 118 » Reducibility and Completeness in Private Computations |
76
Voted
ICIP
2000
IEEE
16 years 2 months ago
2000
IEEE
In thispapel; the reduction of inherent ambiguities in StructurefromMotion(SW)using inertialdata isaddressed. First, we show that the translation-rotation ambiguity inS'from ...
89
Voted
PERCOM
2005
ACM
16 years 5 days ago
2005
ACM
The goal of the MavHome project is to develop technologies to Manage Adaptive Versatile environments. In this paper, we present a complete agent architecture for a single inhabita...
95
Voted
ICALP
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. We prove that observational equivalence of IA3 + Y0 (3rdorder Idealized Algol with 0th-order recursion) is equivalent to the DPDA Equivalence Problem, and hence decidable...
ICNC
2005
Springer
15 years 6 months ago
2005
Springer
In completeness theories of multiple-valued logic, the characterization of Sheffer functions is an important problem，and the solution can be reduced to determining the minimal co...
100
Voted
ROBOCUP
2005
Springer
15 years 6 months ago
2005
Springer
Color calibration is a time-consuming, and therefore costly requirement for most robot teams at RoboCup. This paper presents an approach for autonomous color learning on-board a mo...