Sciweavers

53 search results - page 3 / 11
» How to Strengthen Pseudo-random Generators by Using Compress...
Sort
View
MP
2006
110views more  MP 2006»
13 years 5 months ago
Decomposition and Dynamic Cut Generation in Integer Linear Programming
Decomposition algorithms such as Lagrangian relaxation and Dantzig-Wolfe decomposition are well-known methods that can be used to generate bounds for mixed-integer linear programmi...
Ted K. Ralphs, Matthew V. Galati
ISW
2007
Springer
13 years 11 months ago
New Weaknesses in the Keystream Generation Algorithms of the Stream Ciphers TPy and Py
The stream ciphers Py, Py6 designed by Biham and Seberry were promising candidates in the ECRYPT-eSTREAM project because of their impressive speed. Since their publication in Apri...
Gautham Sekar, Souradyuti Paul, Bart Preneel
ICDE
2003
IEEE
211views Database» more  ICDE 2003»
14 years 6 months ago
Capturing Sensor-Generated Time Series with Quality Guarantees
We are interested in capturing time series generated by small wireless electronic sensors. Battery-operated sensors must avoid heavy use of their wireless radio which is a key cau...
Iosif Lazaridis, Sharad Mehrotra
COR
2008
175views more  COR 2008»
13 years 5 months ago
Lower and upper bounds for a two-level hierarchical location problem in computer networks
In this paper a two-level hierarchical model for the location of concentrators and routers in computers networks is presented. Given a set of candidate locations and the capacitie...
Aníbal Alberto Vilcapoma Ignacio, Virg&iacu...
EMNLP
2011
12 years 5 months ago
Learning Sentential Paraphrases from Bilingual Parallel Corpora for Text-to-Text Generation
Previous work has shown that high quality phrasal paraphrases can be extracted from bilingual parallel corpora. However, it is not clear whether bitexts are an appropriate resourc...
Juri Ganitkevitch, Chris Callison-Burch, Courtney ...