Sciweavers

2124 search results - page 349 / 425
» Aggregating time partitions
Sort
View
DAWAK
2006
Springer
15 years 3 months ago
A Greedy Approach to Concurrent Processing of Frequent Itemset Queries
We consider the problem of concurrent execution of multiple frequent itemset queries. If such data mining queries operate on overlapping parts of the database, then their overall I...
Pawel Boinski, Marek Wojciechowski, Maciej Zakrzew...
ECAI
2006
Springer
15 years 3 months ago
Coalition Structure Generation in Task-Based Settings
The coalition formation process, in which a number of independent, autonomous agents come together to act as a collective, is an important form of interaction in multi-agent system...
Viet Dung Dang, Nicholas R. Jennings
EWCBR
2006
Springer
15 years 3 months ago
Rough Set Feature Selection Algorithms for Textual Case-Based Classification
Feature selection algorithms can reduce the high dimensionality of textual cases and increase case-based task performance. However, conventional algorithms (e.g., information gain)...
Kalyan Moy Gupta, David W. Aha, Philip Moore
APCSAC
2001
IEEE
15 years 3 months ago
The First Real Operating System for Reconfigurable Computers
Traditional reconfigurable computing platforms are designed to be single user and have been acknowledged to be difficult to design applications for. The design tools are still pri...
Grant B. Wigley, David A. Kearney
ESA
2000
Springer
73views Algorithms» more  ESA 2000»
15 years 3 months ago
K-D Trees Are Better when Cut on the Longest Side
We show that a popular variant of the well known k-d tree data structure satisfies an important packing lemma. This variant is a binary spatial partitioning tree T defined on a set...
Matthew Dickerson, Christian A. Duncan, Michael T....