Sciweavers

70 search results - page 10 / 14
» Counting Votes with Formal Methods
Sort
View
AIPS
2008
13 years 11 months ago
A New Probabilistic Plan Recognition Algorithm Based on String Rewriting
This document formalizes and discusses the implementation of a new, more efficient probabilistic plan recognition algorithm called Yet Another Probabilistic Plan Recognizer, (Yapp...
Christopher W. Geib, John Maraist, Robert P. Goldm...
CHARME
2001
Springer
133views Hardware» more  CHARME 2001»
14 years 1 months ago
View from the Fringe of the Fringe
Formal analysis remains outside the mainstream of system design practice. Interactive methods and tools are regarded by some to be on the margin of useful research in this area. Al...
Steven D. Johnson
CVPR
2009
IEEE
15 years 3 months ago
Fast concurrent object localization and recognition
Object localization and classification are important problems in computer vision. However, in many applications, exhaustive search over all class labels and image locations is co...
Tom Yeh, John J. Lee, Trevor Darrell
FMCAD
2007
Springer
14 years 2 months ago
Fast Minimum-Register Retiming via Binary Maximum-Flow
We present a formulation of retiming to minimize the number of registers in a design by iterating a maximum network flow problem. The retiming returned will be the optimum one whi...
Aaron P. Hurst, Alan Mishchenko, Robert K. Brayton
AINA
2009
IEEE
14 years 3 months ago
Modeling Multiprocessor Cache Protocol Impact on MPI Performance
This paper presents a modeling method particularly suited to analyze interactions between Message Passing Interface MPI library execution and distributed cache coherence protocol....
Ghassan Chehaibar, Meriem Zidouni, Radu Mateescu