Sciweavers

2080 search results - page 166 / 416
» Measuring empirical computational complexity
Sort
View
AAAI
2007
15 years 7 months ago
A New Algorithm for Generating Equilibria in Massive Zero-Sum Games
In normal scenarios, computer scientists often consider the number of states in a game to capture the difficulty of learning an equilibrium. However, players do not see games in ...
Martin Zinkevich, Michael H. Bowling, Neil Burch
136
Voted
ALENEX
2010
117views Algorithms» more  ALENEX 2010»
15 years 6 months ago
Untangling the Braid: Finding Outliers in a Set of Streams
Monitoring the performance of large shared computing systems such as the cloud computing infrastructure raises many challenging algorithmic problems. One common problem is to trac...
Chiranjeeb Buragohain, Luca Foschini, Subhash Suri
ECCC
2010
86views more  ECCC 2010»
15 years 4 months ago
On Approximating the Entropy of Polynomial Mappings
We investigate the complexity of the following computational problem: Polynomial Entropy Approximation (PEA): Given a low-degree polynomial mapping p : Fn Fm , where F is a finite...
Zeev Dvir, Dan Gutfreund, Guy N. Rothblum, Salil P...
ICC
2007
IEEE
121views Communications» more  ICC 2007»
15 years 11 months ago
Cooperative Vehicle Position Estimation
Abstract— We present a novel cooperative vehicle position estimation algorithm, which can achieve higher levels of accuracy and reliability than existing GPS based positioning so...
Ryan Parker, Shahrokh Valaee
145
Voted
ICRA
2007
IEEE
168views Robotics» more  ICRA 2007»
15 years 11 months ago
A Multi-State Constraint Kalman Filter for Vision-aided Inertial Navigation
— In this paper, we present an Extended Kalman Filter (EKF)-based algorithm for real-time vision-aided inertial navigation. The primary contribution of this work is the derivatio...
Anastasios I. Mourikis, Stergios I. Roumeliotis