2766 search results - page 528 / 554 » Algorithms for trigonometric polynomials |
KDD
2010
ACM
13 years 12 months ago
2010
ACM
Constrained clustering has been well-studied for algorithms like K-means and hierarchical agglomerative clustering. However, how to encode constraints into spectral clustering rem...
APPROX
2008
Springer
13 years 10 months ago
2008
Springer
Let C be a class of probability distributions over a finite set . A function D : {0, 1}m is a disperser for C with entropy threshold k and error if for any distribution X in C s...
DAGSTUHL
2007
13 years 10 months ago
2007
In this paper we give a specification of a new block cipher that can be called the Courtois Toy Cipher (CTC). It is quite simple, and yet very much like any other known block ciph...
SODA
2008
ACM
13 years 10 months ago
2008
ACM
We analyze several distributed, continuous time protocols for a fair allocation of bandwidths to flows in a network (or resources to agents). Our protocols converge to an allocati...
ATAL
2010
Springer
13 years 9 months ago
2010
Springer
Planning how to interact against bounded memory and unbounded memory learning opponents needs different treatment. Thus far, however, work in this area has shown how to design pla...