Sciweavers

601 search results - page 75 / 121
» Playing large games using simple strategies
Sort
View
ACG
2009
Springer
15 years 8 months ago
Plans, Patterns, and Move Categories Guiding a Highly Selective Search
In this paper we present our ideas for an Arimaa-playing program (also called a bot) that uses plans and pattern matching to guide a highly selective search. We restrict move gener...
Gerhard Trippen
KDD
2006
ACM
164views Data Mining» more  KDD 2006»
16 years 1 months ago
Sampling from large graphs
Given a huge real graph, how can we derive a representative sample? There are many known algorithms to compute interesting measures (shortest paths, centrality, betweenness, etc.)...
Jure Leskovec, Christos Faloutsos
CVPR
2004
IEEE
16 years 3 months ago
Value Directed Learning of Gestures and Facial Displays
This paper presents a method for learning decision theoretic models of facial expressions and gestures from video data. We consider that the meaning of a facial display or gesture...
Jesse Hoey, James J. Little
KDD
2008
ACM
164views Data Mining» more  KDD 2008»
16 years 1 months ago
Microscopic evolution of social networks
We present a detailed study of network evolution by analyzing four large online social networks with full temporal information about node and edge arrivals. For the first time at ...
Jure Leskovec, Lars Backstrom, Ravi Kumar, Andrew ...
NIPS
2007
15 years 2 months ago
Congruence between model and human attention reveals unique signatures of critical visual events
Current computational models of bottom-up and top-down components of attention are predictive of eye movements across a range of stimuli and of simple, fixed visual tasks (such a...
Robert J. Peters, Laurent Itti