Sciweavers

6142 search results - page 504 / 1229
» The Complexity of Partition Functions
Sort
View
IJWMC
2007
66views more  IJWMC 2007»
15 years 6 months ago
Grain: a stream cipher for constrained environments
Abstract. A new stream cipher, Grain, is proposed. The design targets hardware environments where gate count, power consumption and memory is very limited. It is based on two shift...
Martin Hell, Thomas Johansson, Willi Meier
TOC
2008
89views more  TOC 2008»
15 years 6 months ago
Norms, XOR Lemmas, and Lower Bounds for Polynomials and Protocols
Abstract: This paper presents a unified and simple treatment of basic questions concerning two computational models: multiparty communication complexity and polynomials over GF(2)....
Emanuele Viola, Avi Wigderson
INFORMATICALT
2002
140views more  INFORMATICALT 2002»
15 years 6 months ago
Intelligent Initial Finite Element Mesh Generation for Solutions of 2D Problems
The new strategy for non-uniform initial FE mesh generation is presented in this paper. The main focus is set to a priori procedures that define the sizing function independent on ...
Lina Vasiliauskiene, Romualdas Bausys
ML
2002
ACM
223views Machine Learning» more  ML 2002»
15 years 6 months ago
Text Categorization with Support Vector Machines. How to Represent Texts in Input Space?
The choice of the kernel function is crucial to most applications of support vector machines. In this paper, however, we show that in the case of text classification, term-frequenc...
Edda Leopold, Jörg Kindermann
RSA
2002
51views more  RSA 2002»
15 years 6 months ago
Testing subgraphs in large graphs
Let H be a fixed graph with h vertices, let G be a graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it H-free. It is known that in this ca...
Noga Alon