Sciweavers

11051 search results - page 62 / 2211
» An Investigation of Generalized Cases
Sort
View
TCS
2010
13 years 5 months ago
Bounds on the efficiency of black-box commitment schemes
Constructions of cryptographic primitives based on general assumptions (e.g., one-way functions) tend to be less efficient than constructions based on specific (e.g., number-theor...
Omer Horvitz, Jonathan Katz
ICML
2005
IEEE
14 years 11 months ago
A comparison of tight generalization error bounds
We investigate the empirical applicability of several bounds (a number of which are new) on the true error rate of learned classifiers which hold whenever the examples are chosen ...
John Langford, Matti Kääriäinen
WILF
2005
Springer
91views Fuzzy Logic» more  WILF 2005»
14 years 3 months ago
Multi-lattices as a Basis for Generalized Fuzzy Logic Programming
A prospective study of the use of ordered multi-lattices as underlying sets of truth-values for a generalised framework of logic programming is presented. Specifically, we investi...
Jesús Medina, Manuel Ojeda-Aciego, Jorge Ru...
ARCS
2004
Springer
14 years 2 months ago
Evaluation of Run-Time Reconfiguration for General-Purpose Computing
: In order to investigate the impact of dynamic hardware reconfiguration on general-purpose applications, we present a superscalar micro-architecture that includes a variable numbe...
Adronis Niyonkuru, Hans Christoph Zeidler
ADCM
2007
168views more  ADCM 2007»
13 years 10 months ago
A generalization of Gram-Schmidt orthogonalization generating all Parseval frames
Given an arbitrary finite sequence of vectors in a finite–dimensional Hilbert space, we describe an algorithm, which computes a Parseval frame for the subspace generated by the...
Peter G. Casazza, Gitta Kutyniok