Sciweavers

2027 search results - page 105 / 406
» When is it best to best-respond
Sort
View
97
Voted
CCCG
2003
15 years 2 months ago
Computing Delaunay Triangulation with Imprecise Input Data
The key step in the construction of the Delaunay triangulation of a finite set of planar points is to establish correctly whether a given point of this set is inside or outside t...
Ali Asghar Khanban, Abbas Edalat
93
Voted
IJCAI
2001
15 years 2 months ago
Refining the Basic Constraint Propagation Algorithm
Constraint propagation is the main feature of any constraint solver. This is thus of prime importance to manage constraint propagation as efficiently as possible, justifying the us...
Christian Bessière, Jean-Charles Rég...
82
Voted
FIMI
2003
120views Data Mining» more  FIMI 2003»
15 years 2 months ago
MAFIA: A Performance Study of Mining Maximal Frequent Itemsets
We present a performance study of the MAFIA algorithm for mining maximal frequent itemsets from a transactional database. In a thorough experimental analysis, we isolate the effec...
Douglas Burdick, Manuel Calimlim, Jason Flannick, ...
NIPS
2004
15 years 2 months ago
Experts in a Markov Decision Process
We consider an MDP setting in which the reward function is allowed to change during each time step of play (possibly in an adversarial manner), yet the dynamics remain fixed. Simi...
Eyal Even-Dar, Sham M. Kakade, Yishay Mansour
127
Voted
NIPS
2004
15 years 2 months ago
Discriminant Saliency for Visual Recognition from Cluttered Scenes
Saliency mechanisms play an important role when visual recognition must be performed in cluttered scenes. We propose a computational definition of saliency that deviates from exis...
Dashan Gao, Nuno Vasconcelos