Sciweavers

601 search results - page 67 / 121
» Playing large games using simple strategies
Sort
View
EMMCVPR
2011
Springer
14 years 1 months ago
Branch and Bound Strategies for Non-maximal Suppression in Object Detection
In this work, we are concerned with the detection of multiple objects in an image. We demonstrate that typically applied objectives have the structure of a random field model, but...
Matthew B. Blaschko
UIST
2009
ACM
15 years 8 months ago
Optically sensing tongue gestures for computer input
Many patients with paralyzing injuries or medical conditions retain the use of their cranial nerves, which control the eyes, jaw, and tongue. While researchers have explored eye-t...
T. Scott Saponas, Daniel Kelly, Babak A. Parviz, D...
SODA
2012
ACM
278views Algorithms» more  SODA 2012»
13 years 3 months ago
Beyond myopic best response (in Cournot competition)
A Nash Equilibrium is a joint strategy profile at which each agent myopically plays a best response to the other agents’ strategies, ignoring the possibility that deviating fro...
Amos Fiat, Elias Koutsoupias, Katrina Ligett, Yish...
IPPS
2007
IEEE
15 years 7 months ago
RNAVLab: A unified environment for computational RNA structure analysis based on grid computing technology
Ribonucleic acid (RNA) molecules play important roles in many biological processes including gene expression and regulation. An RNA molecule is a linear polymer which folds back o...
Michela Taufer, Ming-Ying Leung, Kyle L. Johnson, ...
AAAI
2000
15 years 2 months ago
Combining Knowledge and Search to Solve Single-Suit Bridge
In problem solving, it is often important not only to find a solution but also to be able to explain it. We use the game of Bridge to illustrate how tactics, which formalise domai...
Ian Frank, David A. Basin, Alan Bundy