Sciweavers

1717 search results - page 35 / 344
» A Computable Spectral Theorem
Sort
View
BSL
2008
98views more  BSL 2008»
15 years 3 months ago
A Natural Axiomatization of Computability and Proof of Church's Thesis
Church's Thesis asserts that the only numeric functions that can be calculated by effective means are the recursive ones, which are the same, extensionally, as the Turingle nu...
Nachum Dershowitz, Yuri Gurevich
156
Voted
SP
2002
IEEE
161views Security Privacy» more  SP 2002»
15 years 3 months ago
Improving Computer Security Using Extended Static Checking
We describe a method for finding security flaws in source code by way of static analysis. The method is notable because it allows a user to specify a wide range of security proper...
Brian Chess
ECCV
2004
Springer
16 years 5 months ago
Kernel Feature Selection with Side Data Using a Spectral Approach
Abstract. We address the problem of selecting a subset of the most relevant features from a set of sample data in cases where there are multiple (equally reasonable) solutions. In ...
Amnon Shashua, Lior Wolf
CGI
2006
IEEE
15 years 7 months ago
Sub-sampling for Efficient Spectral Mesh Processing
In this paper, we apply Nystr
Rong Liu, Varun Jain, Hao Zhang 0002
165
Voted
CIE
2007
Springer
15 years 7 months ago
A Classification of Viruses Through Recursion Theorems
We study computer virology from an abstract point of view. Viruses and worms are self-replicating programs, whose constructions are essentially based on Kleene's second recurs...
Guillaume Bonfante, Matthieu Kaczmarek, Jean-Yves ...