Sciweavers

825 search results - page 100 / 165
» Partitions of an Integer into Powers
Sort
View
MP
2010
116views more  MP 2010»
14 years 10 months ago
New techniques for cost sharing in combinatorial optimization games
Combinatorial optimization games form an important subclass of cooperative games. In recent years, increased attention has been given to the issue of finding good cost shares for...
Alberto Caprara, Adam N. Letchford
SODA
2012
ACM
240views Algorithms» more  SODA 2012»
13 years 2 months ago
Constructing high order elements through subspace polynomials
Every finite field has many multiplicative generators. However, finding one in polynomial time is an important open problem. In fact, even finding elements of high order has n...
Qi Cheng, Shuhong Gao, Daqing Wan
ISCAS
2006
IEEE
145views Hardware» more  ISCAS 2006»
15 years 5 months ago
The wordlength determination problem of linear time invariant systems with multiple outputs - a geometric programming approach
This paper proposes two new methods for optimizing objectives and constraints. The GP approach is very general and hardware resources in finite wordlength implementation of it allo...
S. C. Chan, K. M. Tsui
CCS
2001
ACM
15 years 3 months ago
A verifiable secret shuffle and its application to e-voting
We present a mathematical construct which provides a cryptographic protocol to verifiably shuffle a sequence of k modular integers, and discuss its application to secure, universa...
C. Andrew Neff
SIGMOD
2012
ACM
224views Database» more  SIGMOD 2012»
13 years 2 months ago
Tiresias: the database oracle for how-to queries
How-To queries answer fundamental data analysis questions of the form: “How should the input change in order to achieve the desired output”. As a Reverse Data Management probl...
Alexandra Meliou, Dan Suciu