2157 search results - page 352 / 432 » Binary ant algorithm |
139
click to vote
CCS
2008
ACM
15 years 4 months ago
2008
ACM
We extend the Camenisch-Lysyanskaya anonymous credential system such that selective disclosure of attributes becomes highly efficient. The resulting system significantly improves ...
149
click to vote
CASES
2005
ACM
15 years 4 months ago
2005
ACM
Code compression is a field where compression ratios between compiler-generated code and subsequent compressed code are highly dependent on decisions made at compile time. Most op...
136
click to vote
BMCBI
2010
15 years 2 months ago
2010
Background: A molecular network perspective forms the foundation of systems biology. A common practice in analyzing protein-protein interaction (PPI) networks is to perform networ...
155
click to vote
DATAMINE
1999
15 years 2 months ago
1999
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...
139
click to vote
TIT
2010
14 years 9 months ago
2010
We prove that binary linear concatenated codes with an outer algebraic code (specifically, a folded Reed-Solomon code) and independently and randomly chosen linear inner codes ach...