Sciweavers

1301 search results - page 57 / 261
» Bounded Version Vectors
Sort
View
APPROX
2007
Springer
86views Algorithms» more  APPROX 2007»
15 years 7 months ago
Lower Bounds for Swapping Arthur and Merlin
We prove a lower bound for swapping the order of Arthur and Merlin in two-round MerlinArthur games using black-box techniques. Namely, we show that any AM-game requires time (t2 )...
Scott Diehl
CORR
2008
Springer
106views Education» more  CORR 2008»
15 years 3 months ago
Outer Bounds for Multiple Access Channels with Feedback using Dependence Balance
We use the idea of dependence balance to obtain a new outer bound for the capacity region of the discrete memoryless multiple-access channel with noiseless feedback (MAC-FB). We co...
Ravi Tandon, Sennur Ulukus
AAAI
1997
15 years 5 months ago
Incremental Methods for Computing Bounds in Partially Observable Markov Decision Processes
Partially observable Markov decision processes (POMDPs) allow one to model complex dynamic decision or control problems that include both action outcome uncertainty and imperfect ...
Milos Hauskrecht
EDBT
2006
ACM
145views Database» more  EDBT 2006»
16 years 3 months ago
Indexing Spatially Sensitive Distance Measures Using Multi-resolution Lower Bounds
Abstract. Comparison of images requires a distance metric that is sensitive to the spatial location of objects and features. Such sensitive distance measures can, however, be compu...
Vebjorn Ljosa, Arnab Bhattacharya, Ambuj K. Singh
ICML
2003
IEEE
16 years 4 months ago
Adaptive Overrelaxed Bound Optimization Methods
We study a class of overrelaxed bound optimization algorithms, and their relationship to standard bound optimizers, such as ExpectationMaximization, Iterative Scaling, CCCP and No...
Ruslan Salakhutdinov, Sam T. Roweis