Sciweavers

721 search results - page 86 / 145
» On Generators of Random Quasigroup Problems
Sort
View
IS
2010
13 years 6 months ago
Extracting a largest redundancy-free XML storage structure from an acyclic hypergraph in polynomial time
Given a hypergraph and a set of embedded functional dependencies, we investigate the problem of determining the conditions under which we can efficiently generate redundancy-free ...
Wai Yin Mok, Joseph Fong, David W. Embley
VLDB
2004
ACM
104views Database» more  VLDB 2004»
14 years 1 months ago
Remembrance of Streams Past: Overload-Sensitive Management of Archived Streams
This paper studies Data Stream Management Systems that combine real-time data streams with historical data, and hence access incoming streams and archived data simultaneously. A s...
Sirish Chandrasekaran, Michael J. Franklin
DAGSTUHL
2007
13 years 9 months ago
QUAD: Overview and Recent Developments
We give an outline of the specification and provable security features of the QUAD stream cipher proposed at Eurocrypt 2006 [6]. The cipher relies on the iteration of a multivaria...
David Arditti, Côme Berbain, Olivier Billet,...
TVLSI
2008
151views more  TVLSI 2008»
13 years 8 months ago
Guest Editorial Special Section on Design Verification and Validation
ion levels. The framework also supports the generation of test constraints, which can be satisfied using a constraint solver to generate tests. A compositional verification approac...
I. Harris, D. Pradhan
SAC
2008
ACM
13 years 7 months ago
Whom should I trust?: the impact of key figures on cold start recommendations
Generating adequate recommendations for newcomers is a hard problem for a recommender system (RS) due to lack of detailed user profiles and social preference data. Empirical evide...
Patricia Victor, Chris Cornelis, Ankur Teredesai, ...