Sciweavers

621 search results - page 83 / 125
» Efficient algorithms for minimizing tree pattern queries
Sort
View
KDD
1998
ACM
99views Data Mining» more  KDD 1998»
14 years 3 days ago
On the Efficient Gathering of Sufficient Statistics for Classification from Large SQL Databases
For a wide variety of classification algorithms, scalability to large databases can be achieved by observing that most algorithms are driven by a set of sufficient statistics that...
Goetz Graefe, Usama M. Fayyad, Surajit Chaudhuri
AIIDE
2008
13 years 10 months ago
Dynamic Expansion of Behaviour Trees
Artificial intelligence in games is typically used for creating player's opponents. Manual edition of intelligent behaviors for Non-Player Characters (NPCs) of games is a cum...
Gonzalo Flórez Puga, Marco Antonio Gó...
CP
2009
Springer
14 years 8 months ago
Confidence-Based Work Stealing in Parallel Constraint Programming
The most popular architecture for parallel search is work stealing: threads that have run out of work (nodes to be searched) steal from threads that still have work. Work stealing ...
Geoffrey Chu, Christian Schulte, Peter J. Stuckey
CVPR
2006
IEEE
14 years 10 months ago
Groupwise point pattern registration using a novel CDF-based Jensen-Shannon Divergence
In this paper, we propose a novel and robust algorithm for the groupwise non-rigid registration of multiple unlabeled point-sets with no bias toward any of the given pointsets. To...
Fei Wang, Baba C. Vemuri, Anand Rangarajan
SIGMOD
2007
ACM
181views Database» more  SIGMOD 2007»
14 years 8 months ago
Progressive and selective merge: computing top-k with ad-hoc ranking functions
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
Dong Xin, Jiawei Han, Kevin Chen-Chuan Chang