288 search results - page 23 / 58 » random 1998 |
82
Voted
KDD
1998
ACM
15 years 8 months ago
1998
ACM
Manyreal-world KDDexpeditions involve investigation of relationships betweenvariables in different, heterogeneousdatabases. Wepresent a dynamic programmingtechnique for linking re...
133
Voted
STOC
2006
ACM
16 years 4 months ago
2006
ACM
: We derandomize results of H?astad (1999) and Feige and Kilian (1998) and show that for all > 0, approximating MAX CLIQUE and CHROMATIC NUMBER to within n1are NP-hard. We furt...
134
Voted
ICMCS
1998
IEEE
15 years 8 months ago
1998
IEEE
Current video compression formats optimize for either compression or editing. For example, motion-JPEG (MJPEG) provides excellent random access and moderate overall compression, w...
132
Voted
APPROX
1998
Springer
15 years 8 months ago
1998
Springer
We present randomized approximation algorithms for the circular arc graph colouring problem and for the problem of bandwidth allocation in all-optical ring networks. We obtain a fa...
147
Voted
EUROCRYPT
1998
Springer
15 years 8 months ago
1998
Springer
For the most compelling applications of threshold cryptosystems, security against chosen ciphertext attack is a requirement. However, prior to the results presented here, there ap...