Sciweavers

157 search results - page 1 / 32
» A reduction of the NF consistency problem
Sort
View
66
Voted
JSYML
2007
62views more  JSYML 2007»
14 years 10 months ago
A reduction of the NF consistency problem
We give a necessary and sufficient condition in order that a typeshifting automorphism be constructed on a model of the Theory of Simple Types (TST) by forcing. Namely it is prove...
Athanassios Tzouvaras
81
Voted
FOCM
2008
77views more  FOCM 2008»
14 years 10 months ago
Modular Counting of Rational Points over Finite Fields
Let Fq be the finite field of q elements, where q = ph. Let f(x) be a polynomial over Fq in n variables with m non-zero terms. Let N(f) denote the number of solutions of f(x) = 0 ...
Daqing Wan
80
Voted
FPGA
1995
ACM
110views FPGA» more  FPGA 1995»
15 years 1 months ago
Testing of Uncustomized Segmented Channel Field Programmable Gate Arrays
This paper presents a methodology for production-time testing of (uncustomized) segmented channel eld programmable gate arrays (FPGAs) such as those manufactured by Actel [1]. Th...
Tong Liu, Wei-Kang Huang, Fabrizio Lombardi
97
Voted
CIKM
2008
Springer
15 years 8 days ago
On low dimensional random projections and similarity search
Random projection (RP) is a common technique for dimensionality reduction under L2 norm for which many significant space embedding results have been demonstrated. However, many si...
Yu-En Lu, Pietro Liò, Steven Hand
79
Voted
CCGRID
2001
IEEE
15 years 1 months ago
An Efficient Lock Protocol for Home-Based Lazy Release Consistency
Home-based Lazy Release Consistency (HLRC) shows poor performance on lock based applications because of two reasons: (1) a whole page is fetched on a page fault while actual modif...
Hee-Chul Yun, Sang-Kwon Lee, Joonwon Lee, Seungryo...