Sciweavers

1172 search results - page 201 / 235
» Constructions of generalized Sidon sets
Sort
View
ICISC
2000
126views Cryptology» more  ICISC 2000»
15 years 1 months ago
Cryptographic Applications of Sparse Polynomials over Finite Rings
Abstract. This paper gives new examples that exploit the idea of using sparse polynomials with restricted coefficients over a finite ring for designing fast, reliable cryptosystems...
William D. Banks, Daniel Lieman, Igor Shparlinski,...
KDD
2010
ACM
224views Data Mining» more  KDD 2010»
15 years 3 months ago
Ensemble pruning via individual contribution ordering
An ensemble is a set of learned models that make decisions collectively. Although an ensemble is usually more accurate than a single learner, existing ensemble methods often tend ...
Zhenyu Lu, Xindong Wu, Xingquan Zhu, Josh Bongard
CLEF
2006
Springer
15 years 3 months ago
Overview of WebCLEF 2006
We report on the CLEF 2006 WebCLEF track devoted to crosslingual web retrieval. We provide details about the retrieval tasks, the used topic set, and the results of WebCLEF partic...
Krisztian Balog, Leif Azzopardi, Jaap Kamps, Maart...
DATESO
2007
107views Database» more  DATESO 2007»
15 years 1 months ago
Updating Typed XML Documents Using a Functional Data Model
We address a problem of updating XML documents having their XML schema described by a Document Type Definition (DTD) without breaking their validity. We present a way how to expre...
Pavel Loupal
CORR
2010
Springer
66views Education» more  CORR 2010»
14 years 12 months ago
Polyominoes Simulating Arbitrary-Neighborhood Zippers and Tilings
This paper provides a bridge between the classical tiling theory and cellular automata on one side, and the complex neighborhood self-assembling situations that exist in practice,...
Lila Kari, Benoît Masson