Sciweavers

429 search results - page 85 / 86
» Improved Algorithms for the k Maximum-Sums Problems
Sort
View
COLT
1999
Springer
14 years 3 months ago
Beating the Hold-Out: Bounds for K-fold and Progressive Cross-Validation
The empirical error on a test set, the hold-out estimate, often is a more reliable estimate of generalization error than the observed error on the training set, the training estim...
Avrim Blum, Adam Kalai, John Langford
ENTCS
2006
163views more  ENTCS 2006»
13 years 11 months ago
Design Challenges for a Differential-Power-Analysis Aware GALS-based AES Crypto ASIC
In recent years several successful GALS realizations have been presented. The core of a GALS system is a locally synchronous island that is designed using industry standard synchr...
Frank K. Gürkaynak, Stephan Oetiker, Hubert K...
WWW
2008
ACM
14 years 11 months ago
Keysurf: a character controlled browser for people with physical disabilities
For many users with a physical or motor disability, using a computer mouse or other pointing device to navigate the web is cumbersome or impossible due to problems with pointing a...
Leo Spalteholz, Kin Fun Li, Nigel Livingston, Foad...
SIGIR
2009
ACM
14 years 5 months ago
Addressing morphological variation in alphabetic languages
The selection of indexing terms for representing documents is a key decision that limits how effective subsequent retrieval can be. Often stemming algorithms are used to normaliz...
Paul McNamee, Charles K. Nicholas, James Mayfield
FOCS
2000
IEEE
14 years 3 months ago
Opportunistic Data Structures with Applications
There is an upsurging interest in designing succinct data structures for basic searching problems (see [23] and references therein). The motivation has to be found in the exponent...
Paolo Ferragina, Giovanni Manzini