Sciweavers

685 search results - page 91 / 137
» Succinct Trees in Practice
Sort
View
SDM
2010
SIAM
181views Data Mining» more  SDM 2010»
13 years 9 months ago
Making k-means Even Faster
The k-means algorithm is widely used for clustering, compressing, and summarizing vector data. In this paper, we propose a new acceleration for exact k-means that gives the same a...
Greg Hamerly
AAAI
2006
13 years 9 months ago
Prob-Maxn: Playing N-Player Games with Opponent Models
Much of the work on opponent modeling for game tree search has been unsuccessful. In two-player, zero-sum games, the gains from opponent modeling are often outweighed by the cost ...
Nathan R. Sturtevant, Martin Zinkevich, Michael H....
DLT
2003
13 years 9 months ago
Boolean Grammars
A new generalization of context-free grammars is introduced: Boolean grammars allow the use of all set-theoretic operations as an integral part of the formalism of rules. Rigorous...
Alexander Okhotin
MVA
1994
145views Computer Vision» more  MVA 1994»
13 years 9 months ago
Machine Vision Based Inspection of Textile Fabrics
Several issues on automatic inspection of textile fabrics are discussed in this paper. To avoid the intense computation for real time inspection, we suggest a parallel pyramid har...
Chuanjun Wang, Chih-Ho Yu
ATAL
2010
Springer
13 years 8 months ago
Improving DPOP with function filtering
DPOP is an algorithm for distributed constraint optimization which has, as main drawback, the exponential size of some of its messages. Recently, some algorithms for distributed c...
Ismel Brito, Pedro Meseguer