Sciweavers

2173 search results - page 1 / 435
» On the Values of Reducibility Candidates
Sort
View
TLCA
2009
Springer
13 years 11 months ago
On the Values of Reducibility Candidates
The straightforward elimination of union types is known to break subject reduction, and for some extensions of the lambda-calculus, to break strong normalization as well. Similarly...
Colin Riba
CIKM
2005
Springer
13 years 10 months ago
Optimizing candidate check costs for bitmap indices
In this paper, we propose a new strategy for optimizing the placement of bin boundaries to minimize the cost of query evaluation using bitmap indices with binning. For attributes ...
Doron Rotem, Kurt Stockinger, Kesheng Wu
TCC
2009
Springer
169views Cryptology» more  TCC 2009»
14 years 5 months ago
Goldreich's One-Way Function Candidate and Myopic Backtracking Algorithms
Abstract. Goldreich (ECCC 2000) proposed a candidate one-way function construction which is parameterized by the choice of a small predicate (over d = O(1) variables) and of a bipa...
James Cook, Omid Etesami, Rachel Miller, Luca Trev...
CBMS
1998
IEEE
13 years 9 months ago
Lexicon Assistance Reduces Manual Verification of OCR Output
An OCR system chosen for its high recognition rate and low percent of false positives also assigns low confidence values to many characters that are actually correct. Human operat...
Susan E. Hauser, A. C. Browne, George R. Thoma, Al...
IV
2008
IEEE
91views Visualization» more  IV 2008»
13 years 11 months ago
Candidate Mapping: Finding Your Place Amongst the Candidates
The process ofvoting for a candidate involves selecting an individual who best matches a personal system of values and beliefs. Typically, voters must select a candidate whom they...
Justin Donaldson, William R. Hazlewood