4797 search results - page 239 / 960 » The complexity of partition tasks |
161
click to vote
ICMLA
2008
15 years 8 months ago
2008
A method is presented to partition a given set of data entries embedded in Euclidean space by recursively bisecting clusters into smaller ones. The initial set is subdivided into ...
173
click to vote
OPODIS
2008
15 years 8 months ago
2008
We study the group renaming problem, which is a natural generalization of the renaming problem. An instance of this problem consists of n processors, partitioned into m groups, ea...
129
click to vote
EACL
2006
ACL Anthology
15 years 8 months ago
2006
ACL Anthology
In this paper, we present an automated, quantitative, knowledge-poor method to evaluate the randomness of a collection of documents (corpus), with respect to a number of biased pa...
176
click to vote
FMSD
2008
15 years 6 months ago
2008
Abstract Compositional reasoning aims to improve scalability of verification tools by reducing the original verification task into subproblems. The simplification is typically base...
169
click to vote
IJCINI
2008
15 years 6 months ago
2008
An artificial neural network was trained to classify musical chords into four categories--major, dominant seventh, minor, or diminished seventh--independent of musical key. After ...