Sciweavers

580 search results - page 96 / 116
» Choosing a random peer
Sort
View
AAAI
2006
15 years 1 months ago
Overconfidence or Paranoia? Search in Imperfect-Information Games
We derive a recursive formula for expected utility values in imperfect- information game trees, and an imperfectinformation game tree search algorithm based on it. The formula and...
Austin Parker, Dana S. Nau, V. S. Subrahmanian
SODA
2001
ACM
79views Algorithms» more  SODA 2001»
15 years 1 months ago
Learning Markov networks: maximum bounded tree-width graphs
Markov networks are a common class of graphical models used in machine learning. Such models use an undirected graph to capture dependency information among random variables in a ...
David R. Karger, Nathan Srebro
SPIESR
2001
105views Database» more  SPIESR 2001»
15 years 1 months ago
Video summarization using motion descriptors
We describe a technique for video summarization that uses motion descriptors computed in the compressed domain to speed up conventional color based video summarization technique. ...
Ajay Divakaran, Kadir A. Peker, Huifang Sun
DSP
2006
14 years 12 months ago
Adaptive multi-modality sensor scheduling for detection and tracking of smart targets
This paper considers the problem of sensor scheduling for the purposes of detection and tracking of "smart" targets. Smart targets are targets that can detect when they ...
Christopher M. Kreucher, Doron Blatt, Alfred O. He...
JCP
2008
114views more  JCP 2008»
14 years 12 months ago
Statistical Analysis and Data Analysis of Stock Market by Interacting Particle Models
The statistical analysis of Chinese stock market fluctuations modeled by the interacting particle systems has been done in this paper. The contact model and voter model of the inte...
Jun Wang, Bingli Fan, Tiansong Wang