Sciweavers

8746 search results - page 1566 / 1750
» Diversifying search results
Sort
View
SDM
2004
SIAM
207views Data Mining» more  SDM 2004»
13 years 10 months ago
BAMBOO: Accelerating Closed Itemset Mining by Deeply Pushing the Length-Decreasing Support Constraint
Previous study has shown that mining frequent patterns with length-decreasing support constraint is very helpful in removing some uninteresting patterns based on the observation t...
Jianyong Wang, George Karypis
MSO
2003
13 years 10 months ago
Simulation based Development of Efficient Hardware for Sort based Algorithms
The use of sub-optimal digital systems can at times lead to high speed, efficient, costeffective structures that are sufficient to perform needed tasks. We describe here a system ...
Niklas Hansson, Jay H. Harris
NIPS
1996
13 years 10 months ago
Maximum Likelihood Blind Source Separation: A Context-Sensitive Generalization of ICA
In the square linear blind source separation problem, one must nd a linear unmixing operator which can detangle the result xi(t) of mixing n unknown independent sources si(t) thro...
Barak A. Pearlmutter, Lucas C. Parra
AIPS
2010
13 years 10 months ago
Incrementally Solving STNs by Enforcing Partial Path Consistency
Efficient management and propagation of temporal constraints is important for temporal planning as well as for scheduling. During plan development, new events and temporal constra...
Léon Planken, Mathijs de Weerdt, Neil Yorke...
ATAL
2010
Springer
13 years 10 months ago
Asynchronous algorithms for approximate distributed constraint optimization with quality bounds
Distributed Constraint Optimization (DCOP) is a popular framework for cooperative multi-agent decision making. DCOP is NPhard, so an important line of work focuses on developing f...
Christopher Kiekintveld, Zhengyu Yin, Atul Kumar, ...
« Prev « First page 1566 / 1750 Last » Next »