Sciweavers

400 search results - page 75 / 80
» Hard Problem Generation for MKP
Sort
View
STOC
2003
ACM
188views Algorithms» more  STOC 2003»
14 years 7 months ago
Almost random graphs with simple hash functions
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
Martin Dietzfelbinger, Philipp Woelfel
WSDM
2009
ACM
136views Data Mining» more  WSDM 2009»
14 years 2 months ago
Mining common topics from multiple asynchronous text streams
Text streams are becoming more and more ubiquitous, in the forms of news feeds, weblog archives and so on, which result in a large volume of data. An effective way to explore the...
Xiang Wang 0002, Kai Zhang, Xiaoming Jin, Dou Shen
ASIACRYPT
2009
Springer
14 years 2 months ago
Smooth Projective Hashing and Password-Based Authenticated Key Exchange from Lattices
Abstract. We describe a public-key encryption scheme based on lattices — specifically, based on the hardness of the learning with error (LWE) problem — that is secure against ...
Jonathan Katz, Vinod Vaikuntanathan
PIMRC
2008
IEEE
14 years 1 months ago
Connection admission control and grade of service for QoS routing in mesh networks
—Wireless mesh networks (WMNs) is a promising key technology for next generation wireless backhauling that have recently attracted both the academic and industrial interest. Such...
Chi Harold Liu, Athanasios Gkelias, Kin K. Leung
KBSE
2007
IEEE
14 years 1 months ago
Direct-dependency-based software compatibility testing
Software compatibility testing is an important quality assurance task aimed at ensuring that component-based software systems build and/or execute properly across a broad range of...
Il-Chul Yoon, Alan Sussman, Atif M. Memon, Adam A....