Sciweavers

840 search results - page 84 / 168
» The Complexity of the Extended GCD Problem
Sort
View
DSN
2007
IEEE
14 years 2 months ago
Dynamic Fault Tree Analysis Using Input/Output Interactive Markov Chains
Dynamic Fault Trees (DFT) extend standard fault trees by allowing the modeling of complex system components’ behaviors and interactions. Being a high level model and easy to use...
Hichem Boudali, Pepijn Crouzen, Mariëlle Stoe...
ICRA
2003
IEEE
103views Robotics» more  ICRA 2003»
14 years 1 months ago
Simultaneous localization and mapping with unknown data association using fastSLAM
— The Extended Kalman Filter (EKF) has been the de facto approach to the Simultaneous Localization and Mapping (SLAM) problem for nearly fifteen years. However, the EKF has two ...
Michael Montemerlo, Sebastian Thrun
IEEEPACT
1999
IEEE
14 years 6 days ago
A Cost-Effective Clustered Architecture
In current superscalar processors, all floating-point resources are idle during the execution of integer programs. As previous works show, this problem can be alleviated if the fl...
Ramon Canal, Joan-Manuel Parcerisa, Antonio Gonz&a...
VLDB
1992
ACM
116views Database» more  VLDB 1992»
13 years 12 months ago
Supporting Lists in a Data Model (A Timely Approach)
This paper considers the problem of adding list as a type constructor to an object-oriented data model. In particular, we are concerned with how lists in a database can be constru...
Joel E. Richardson
TCC
2007
Springer
170views Cryptology» more  TCC 2007»
14 years 2 months ago
Secure Linear Algebra Using Linearly Recurrent Sequences
In this work we present secure two-party protocols for various core problems in linear algebra. Our main result is a protocol to obliviously decide singularity of an encrypted matr...
Eike Kiltz, Payman Mohassel, Enav Weinreb, Matthew...