Sciweavers

1684 search results - page 141 / 337
» The lexicographic decision function
Sort
View
ISF
2007
119views more  ISF 2007»
15 years 3 months ago
Managing the false alarms: A framework for assurance and verification of surveillance monitoring
This article discusses methods to support assurance of surveillance monitoring; and compliance verification knowledge management (CV-KM). The discussion includes aspects of primar...
Peter Goldschmidt
AI
2011
Springer
14 years 11 months ago
Relational preference rules for control
Much like relational probabilistic models, the need for relational preference models arises naturally in real-world applications where the set of object classes is fixed, but obj...
Ronen I. Brafman
ICASSP
2011
IEEE
14 years 7 months ago
A sliding-window online fast variational sparse Bayesian learning algorithm
In this work a new online learning algorithm that uses automatic relevance determination (ARD) is proposed for fast adaptive nonlinear filtering. A sequential decision rule for i...
Thomas Buchgraber, Dmitriy Shutin, H. Vincent Poor
TOG
2012
230views Communications» more  TOG 2012»
13 years 6 months ago
Decoupling algorithms from schedules for easy optimization of image processing pipelines
Using existing programming tools, writing high-performance image processing code requires sacrificing readability, portability, and modularity. We argue that this is a consequenc...
Jonathan Ragan-Kelley, Andrew Adams, Sylvain Paris...
141
Voted
FOCS
2005
IEEE
15 years 9 months ago
Lower Bounds for the Noisy Broadcast Problem
We prove the first non-trivial (super linear) lower bound in the noisy broadcast model, defined by El Gamal in [6]. In this model there are n + 1 processors P0, P1, . . . , Pn, ...
Navin Goyal, Guy Kindler, Michael E. Saks