Sciweavers

948 search results - page 55 / 190
» What can we achieve by arbitrary announcements
Sort
View
UAI
2004
13 years 9 months ago
Computing Nash Equilibria of Action-Graph Games
Action-graph games (AGGs) are a fully expressive game representation which can compactly express both strict and context-specific independence between players' utility functi...
Navin A. R. Bhat, Kevin Leyton-Brown
ASAP
2006
IEEE
147views Hardware» more  ASAP 2006»
13 years 9 months ago
Reconfigurable Shuffle Network Design in LDPC Decoders
Several semi-parallel decoding architectures have been explored by researchers for the quasi-cyclic low density parity check (LDPC) codes. In these architectures, the reconfigurab...
Jun Tang, Tejas Bhatt, Vishwas Sundaramurthy
ICPR
2006
IEEE
14 years 8 months ago
An Empirical Model for Saturation and Capacity in Classifier Spaces
When assessing reported classification results based on selection of members from a database (e.g. a face database), one would like to know what is an achievable classification ra...
Robert B. Fisher
AAAI
2007
13 years 10 months ago
Reasoning from Desires to Intentions: A Dialectical Framework
Here, we define a framework where defeasible argumentation is used for reasoning about beliefs, desires and intentions. A dialectical filtering process is introduced to obtain a...
Nicolás D. Rotstein, Alejandro Javier Garc&...
CVPR
2009
IEEE
15 years 2 months ago
Alphabet SOUP: A Framework for Approximate Energy Minimization
Many problems in computer vision can be modeled using conditional Markov random fields (CRF). Since finding the maximum a posteriori (MAP) solution in such models is NP-hard, mu...
Stephen Gould (Stanford University), Fernando Amat...