Sciweavers

236 search results - page 1 / 48
» Binary Partitions Revisited
Sort
View
JCT
2002
84views more  JCT 2002»
13 years 4 months ago
Binary Partitions Revisited
The restricted binary partition function bk(n) enumerates the number of ways to represent n as n = 2a0 + 2a1 +
Øystein J. Rødseth, James A. Sellers
ICCAD
2002
IEEE
82views Hardware» more  ICCAD 2002»
13 years 9 months ago
Hardware/software partitioning of software binaries
Partitioning an embedded system application among a microprocessor and custom hardware has been shown to improve the performance, power or energy of numerous examples. The advent ...
Greg Stitt, Frank Vahid
AI
2010
Springer
13 years 6 months ago
Improving Multiclass Text Classification with Error-Correcting Output Coding and Sub-class Partitions
Error-Correcting Output Coding (ECOC) is a general framework for multiclass text classification with a set of binary classifiers. It can not only help a binary classifier solve mul...
Baoli Li, Carl Vogel
ECSQARU
2003
Springer
13 years 10 months ago
Computational-Workload Based Binarization and Partition of Qualitative Markov Trees for Belief Combination
Abstract. Binary join trees have been a popular structure to compute the impact of multiple belief functions initially assigned to nodes of trees or networks. Shenoy has proposed t...
Weiru Liu, Xin Hong, Kenneth Adamson
CRYPTO
2004
Springer
111views Cryptology» more  CRYPTO 2004»
13 years 10 months ago
Signed Binary Representations Revisited
The most common method for computing exponentiation of random elements in Abelian groups are sliding window schemes, which enhance the efficiency of the binary method at the expens...
Katsuyuki Okeya, Katja Schmidt-Samoa, Christian Sp...