Sciweavers

2098 search results - page 166 / 420
» The Persistent Abstract Machine
Sort
View
ZUM
2000
Springer
101views Formal Methods» more  ZUM 2000»
15 years 10 months ago
Analysis of Compiled Code: A Prototype Formal Model
Abstract. This paper reports on an experimental application of formal specification to inform analysis of compiled code. The analyses with are concerned attempt to recover abstract...
R. D. Arthan
POPL
2006
ACM
16 years 6 months ago
Adventures in time and space
Abstract. This paper investigates what is essentially a call-by-value version of PCF under a complexity-theoretically motivated type system. The programming formalism, ATR, has its...
Norman Danner, James S. Royer
COLT
2010
Springer
15 years 4 months ago
Characterization of Linkage-based Clustering
Clustering is a central unsupervised learning task with a wide variety of applications. Not surprisingly, there exist many clustering algorithms. However, unlike classification ta...
Margareta Ackerman, Shai Ben-David, David Loker
ALT
2008
Springer
16 years 3 months ago
Computational Models of Neural Representations in the Human Brain
Abstract For many centuries scientists have wondered how the human brain represents thoughts in terms of the underlying biology of neural activity. Philosophers, linguists, cogniti...
Tom M. Mitchell
136
Voted
MLG
2007
Springer
16 years 14 days ago
A Universal Kernel for Learning Regular Languages
We give a universal kernel that renders all the regular languages linearly separable. We are not able to compute this kernel efficiently and conjecture that it is intractable, but...
Leonid Kontorovich