Sciweavers

2887 search results - page 273 / 578
» Name Generation and Linearity
Sort
View
ACISP
2007
Springer
15 years 10 months ago
Practical Compact E-Cash
Compact e-cash schemes allow a user to withdraw a wallet containing k coins in a single operation, each of which the user can spend unlinkably. One big open problem for compact e-c...
Man Ho Au, Willy Susilo, Yi Mu
APPROX
2006
Springer
126views Algorithms» more  APPROX 2006»
15 years 10 months ago
Better Approximations for the Minimum Common Integer Partition Problem
Abstract. In the k-Minimum Common Integer Partition Problem, abbreviated k-MCIP, we are given k multisets X1, . . . , Xk of positive integers, and the goal is to find an integer mu...
David P. Woodruff
FPL
2004
Springer
100views Hardware» more  FPL 2004»
15 years 10 months ago
On Optimal Irregular Switch Box Designs
In this paper, we develop a unified theory in analyzing optimal switch box design problems, particularly for the unsolved irregular cases, where different pin counts are allowed on...
Hongbing Fan, Yu-Liang Wu, Chak-Chung Cheung, Jipi...
ECML
2006
Springer
15 years 10 months ago
Deconvolutive Clustering of Markov States
In this paper we formulate the problem of grouping the states of a discrete Markov chain of arbitrary order simultaneously with deconvolving its transition probabilities. As the na...
Ata Kabán, Xin Wang
GECCO
2006
Springer
165views Optimization» more  GECCO 2006»
15 years 10 months ago
Comparing mathematical models on the problem of network inference
In this paper we address the problem of finding gene regulatory networks from experimental DNA microarray data. We focus on the evaluation of the performance of different mathemat...
Christian Spieth, Nadine Hassis, Felix Streichert