Sciweavers

205 search results - page 12 / 41
» When Can Limited Randomness Be Used in Repeated Games
Sort
View
122
Voted
EMMCVPR
1999
Springer
15 years 5 months ago
Auxiliary Variables for Markov Random Fields with Higher Order Interactions
Markov Random Fields are widely used in many image processing applications. Recently the shortcomings of some of the simpler forms of these models have become apparent, and models ...
Robin D. Morris
SIGIR
2010
ACM
15 years 4 months ago
Exploring the use of labels to shortcut search trails
Search trails comprising queries and Web page views are created as searchers engage in information-seeking activity online. During known-item search (where the objective may be to...
Ryen W. White, Raman Chandrasekar
113
Voted
ALGORITHMICA
2010
154views more  ALGORITHMICA 2010»
15 years 24 days ago
On the Convergence of Multicast Games in Directed Networks
We investigate the convergence of the price of anarchy after a limited number of moves in the classical multicast communication game when the underlying communication networks is ...
Angelo Fanelli, Michele Flammini, Luca Moscardelli
CGO
2004
IEEE
15 years 4 months ago
A Compiler Scheme for Reusing Intermediate Computation Results
Recent research has shown that programs often exhibit value locality. Such locality occurs when a code segment, although executed repeatedly in the program, takes only a small num...
Yonghua Ding, Zhiyuan Li
111
Voted
AAAI
2008
15 years 3 months ago
ARMOR Security for Los Angeles International Airport
Security at major locations of economic or political importance is a key concern around the world, particularly given the threat of terrorism. Limited security resources prevent f...
James Pita, Manish Jain, Fernando Ordó&ntil...