Sciweavers

4324 search results - page 107 / 865
» A Generalized Representer Theorem
Sort
View
ACL
2010
15 years 2 months ago
A Generalized-Zero-Preserving Method for Compact Encoding of Concept Lattices
Constructing an encoding of a concept lattice using short bit vectors allows for efficient computation of join operations on the lattice. Join is the central operation any unifica...
Matthew Skala, Victoria Krakovna, János Kra...
TIT
2002
63views more  TIT 2002»
15 years 4 months ago
Fibonacci and Galois representations of feedback-with-carry shift registers
Feedback with carry shift registers (FCSRs) are a class of finite state devices that are similar to linear feedback shift registers (LFSRs) in their simplicity and statistical ran...
Mark Goresky, Andrew Klapper
ICML
2009
IEEE
16 years 5 months ago
PAC-Bayesian learning of linear classifiers
We present a general PAC-Bayes theorem from which all known PAC-Bayes risk bounds are obtained as particular cases. We also propose different learning algorithms for finding linea...
Alexandre Lacasse, François Laviolette, Mar...
COMPGEOM
2005
ACM
15 years 6 months ago
Incidences of not-too-degenerate hyperplanes
We present a multi-dimensional generalization of the Szemer´edi-Trotter Theorem, and give a sharp bound on the number of incidences of points and not-too-degenerate hyperplanes i...
György Elekes, Csaba D. Tóth
COMBINATORICS
2006
96views more  COMBINATORICS 2006»
15 years 4 months ago
A New Statistic on Linear and Circular r-Mino Arrangements
We introduce a new statistic on linear and circular r-mino arrangements which leads to interesting polynomial generalizations of the r-Fibonacci and r-Lucas sequences. By studying...
Mark A. Shattuck, Carl G. Wagner