13 years 4 months ago
Optimal Partitions of Data In Higher Dimensions
Given any collection of data cells in a data space X, consider the problem of finding the optimal partition of the data cells into blocks which are unions of cells. The algorithms...
Bradley W. Jackson, Jeffrey D. Scargle, Chris Cusa...
143views more  DATAMINE 1999»
13 years 6 months ago
Partitioning Nominal Attributes in Decision Trees
To find the optimal branching of a nominal attribute at a node in an L-ary decision tree, one is often forced to search over all possible L-ary partitions for the one that yields t...
Don Coppersmith, Se June Hong, Jonathan R. M. Hosk...
64views VLSI» more  DFT 2005»
14 years 22 days ago
Implementation of Concurrent Checking Circuits by Independent Sub-circuits
The present paper proposes a new method for detecting arbitrary faults in a functional circuit when the set of codewords is limited and known in advance. The method is based on im...
Vladimir Ostrovsky, Ilya Levin
151views Economy» more  WINE 2007»
14 years 1 months ago
Computing Optimal Bundles for Sponsored Search
A context in sponsored search is additional information about a query, such as the user’s age, gender or location, that can change an advertisement’s relevance or an advertise...
Arpita Ghosh, Hamid Nazerzadeh, Mukund Sundararaja...