219 search results - page 36 / 44 » Optimal dyadic decision trees |
163
Voted
IPPS
2003
IEEE
15 years 9 months ago
2003
IEEE
In this paper we investigate protocols for scheduling applications that consist of large numbers of identical, independent tasks on large-scale computing platforms. By imposing a ...
149
click to vote
ICCV
2005
IEEE
16 years 5 months ago
2005
IEEE
Although a considerable amount of work has been published on material classification, relatively little of it studies situations with considerable variation within each class. Man...
126
Voted
DEXA
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Fine-grained lock protocols should allow for highly concurrent transaction processing on XML document trees, which is addressed by the taDOM lock protocol family enabling...
111
Voted
ICPR
2004
IEEE
16 years 4 months ago
2004
IEEE
We define a cluster to be characterized by regions of high density separated by regions that are sparse. By observing the downward closure property of density, the search for inte...
145
Voted
FOCS
2008
IEEE
15 years 10 months ago
2008
IEEE
We show a tight lower bound of Ω(N log log N) on the number of transmissions required to compute several functions (including the parity function and the majority function) in a...