Sciweavers

288 search results - page 23 / 58
» random 1998
Sort
View
65
Voted
KDD
1998
ACM
193views Data Mining» more  KDD 1998»
15 years 4 months ago
Methods for Linking and Mining Massive Heterogeneous Databases
Manyreal-world KDDexpeditions involve investigation of relationships betweenvariables in different, heterogeneousdatabases. Wepresent a dynamic programmingtechnique for linking re...
José C. Pinheiro, Don X. Sun
108
Voted
STOC
2006
ACM
116views Algorithms» more  STOC 2006»
16 years 22 days ago
Linear degree extractors and the inapproximability of max clique and chromatic number
: 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...
David Zuckerman
101
Voted
ICMCS
1998
IEEE
157views Multimedia» more  ICMCS 1998»
15 years 4 months ago
Compressed Domain Transcoding of MPEG
Current video compression formats optimize for either compression or editing. For example, motion-JPEG (MJPEG) provides excellent random access and moderate overall compression, w...
Soam Acharya, Brian C. Smith
98
Voted
APPROX
1998
Springer
150views Algorithms» more  APPROX 1998»
15 years 4 months ago
Approximating Circular Arc Colouring and Bandwidth Allocation in All-Optical Ring Networks
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...
Vijay Kumar
122
Voted
EUROCRYPT
1998
Springer
15 years 4 months ago
Securing Threshold Cryptosystems against Chosen Ciphertext Attack
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...
Victor Shoup, Rosario Gennaro