2652 search results - page 158 / 531 » Privacy-preserving linear programming |
131
Voted
SAGT
2010
Springer
15 years 1 months ago
2010
Springer
The solution to a Nash or a nonsymmetric bargaining game is obtained by maximizing a concave function over a convex set, i.e., it is the solution to a convex program. We show that...
150
Voted
ICFP
2007
ACM
16 years 3 months ago
2007
ACM
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
118
Voted
ICIP
2001
IEEE
16 years 5 months ago
2001
IEEE
An elementary proof of a basic uncertainty principle concerning pairs of representations of ?? vectors in different orthonormal bases is provided. The result, slightly stronger th...
127
click to vote
ICCAD
2003
IEEE
16 years 8 days ago
2003
IEEE
A new technique for the logic synthesis of asynchronous circuits is presented. It is based on the structural theory of Petri nets and integer linear programming. The technique is ...
148
click to vote
ICASSP
2009
IEEE
15 years 10 months ago
2009
IEEE
We introduce a model for extractive meeting summarization based on the hypothesis that utterances convey bits of information, or concepts. Using keyphrases as concepts weighted by...