Sciweavers

1184 search results - page 143 / 237
» Nearness relations and topology
Sort
View
FCCM
1999
IEEE
122views VLSI» more  FCCM 1999»
14 years 2 months ago
Safe and Protected Execution for the Morph/AMRM Reconfigurable Processor
Technology scaling of CMOS processes brings relatively faster transistors (gates) and slower interconnects (wires), making viable the addition of reconfigurability to increase per...
Andrew A. Chien, Jay H. Byun
IPPS
1999
IEEE
14 years 2 months ago
Mechanical Verification of a Garbage Collector
Abstract. We describe how the PVS verification system has been used to verify a safety property of a garbage collection algorithm, originally suggested by Ben-Ari. The safety prope...
Klaus Havelund
COCOON
1999
Springer
14 years 2 months ago
Distributionally-Hard Languages
Cai and Selman [CS99] defined a modification of Levin’s notion of average polynomial time and proved, for every P-bi-immune language L and every polynomial-time computable dis...
Lance Fortnow, Aduri Pavan, Alan L. Selman
EUROCOLT
1999
Springer
14 years 2 months ago
Regularized Principal Manifolds
Many settings of unsupervised learning can be viewed as quantization problems — the minimization of the expected quantization error subject to some restrictions. This allows the ...
Alex J. Smola, Robert C. Williamson, Sebastian Mik...
ALT
1998
Springer
14 years 2 months ago
Predictive Learning Models for Concept Drift
Concept drift means that the concept about which data is obtained may shift from time to time, each time after some minimum permanence. Except for this minimum permanence, the con...
John Case, Sanjay Jain, Susanne Kaufmann, Arun Sha...