Sciweavers

1248 search results - page 11 / 250
» On the Number of Birch Partitions
Sort
View
RSCTC
2000
Springer
143views Fuzzy Logic» more  RSCTC 2000»
14 years 4 days ago
On Efficient Construction of Decision Trees from Large Databases
The main task in decision tree construction algorithms is to find the "best partition" of the set of objects. In this paper, we investigate the problem of optimal binary ...
Hung Son Nguyen
RTCSA
2000
IEEE
14 years 29 days ago
Fixed-priority preemptive multiprocessor scheduling: to partition or not to partition
Traditional multiprocessor real-time scheduling partitions a task set and applies uniprocessor scheduling on each processor. By allowing a task to resume on another processor than...
Björn Andersson, Jan Jonsson
ISCC
2007
IEEE
108views Communications» more  ISCC 2007»
14 years 2 months ago
Recursively Partitioned Static IP Router-Tables
We propose a method–recursive partitioning–to partition a static IP router table so that when each partition is represented using a base structure such as a multibit trie or a...
Wencheng Lu, Sartaj Sahni
TDP
2010
166views more  TDP 2010»
13 years 3 months ago
Communication-Efficient Privacy-Preserving Clustering
The ability to store vast quantities of data and the emergence of high speed networking have led to intense interest in distributed data mining. However, privacy concerns, as well ...
Geetha Jagannathan, Krishnan Pillaipakkamnatt, Reb...
ARSCOM
2004
124views more  ARSCOM 2004»
13 years 8 months ago
The Domatic Number of Regular Graphs
The domatic number of a graph G is the maximum number of dominating sets into which the vertex set of G can be partitioned. We show that the domatic number of a random r-regular g...
Peter Dankelmann, Neil J. Calkin