Sciweavers

1991 search results - page 66 / 399
» Small Models of Large Machines
Sort
View
IJCNN
2007
IEEE
15 years 4 months ago
Agnostic Learning versus Prior Knowledge in the Design of Kernel Machines
Abstract— The optimal model parameters of a kernel machine are typically given by the solution of a convex optimisation problem with a single global optimum. Obtaining the best p...
Gavin C. Cawley, Nicola L. C. Talbot
HPCA
2008
IEEE
15 years 10 months ago
Fundamental performance constraints in horizontal fusion of in-order cores
A conceptually appealing approach to supporting a broad range of workloads is a system comprising many small cores that can be fused, on demand, into larger cores. We demonstrate ...
Pierre Salverda, Craig B. Zilles
EUROCRYPT
2010
Springer
15 years 1 months ago
Constructing Verifiable Random Functions with Large Input Spaces
We present a family of verifiable random functions which are provably secure for exponentially-large input spaces under a non-interactive complexity assumption. Prior construction...
Susan Hohenberger, Brent Waters
IACR
2011
110views more  IACR 2011»
13 years 9 months ago
On the (In)security of Hash-based Oblivious RAM and a New Balancing Scheme
With the gaining popularity of remote storage (e.g. in the Cloud), we consider the setting where a small, protected local machine wishes to access data on a large, untrusted remot...
Eyal Kushilevitz, Steve Lu, Rafail Ostrovsky
IUI
2009
ACM
15 years 6 months ago
Searching large indexes on tiny devices: optimizing binary search with character pinning
The small physical size of mobile devices imposes dramatic restrictions on the user interface (UI). With the ever increasing capacity of these devices as well as access to large o...
Guy Shani, Christopher Meek, Tim Paek, Bo Thiesson...