Sciweavers

275 search results - page 31 / 55
» Sequential Construction of Logical Forms
Sort
View
JUCS
2010
110views more  JUCS 2010»
13 years 2 months ago
On Choice Principles and Fan Theorems
: Veldman proved that the contrapositive of countable binary choice is a theorem of full-fledged intuitionism, to which end he used a principle of continuous choice and the fan the...
Hannes Diener, Peter Schuster
BICOB
2009
Springer
14 years 2 months ago
Graph Spectral Approach for Identifying Protein Domains
Here we present a simple method based on graph spectral properties to automatically partition multi-domain proteins into individual domains. The identification of structural domain...
Hari Krishna Yalamanchili, Nita Parekh
SP
1998
IEEE
106views Security Privacy» more  SP 1998»
13 years 11 months ago
Understanding Java Stack Inspection
Current implementations of Java make security decisions by searching the runtime call stack. These systems have attractive security properties, but they have been criticized as be...
Dan S. Wallach, Edward W. Felten
JANCL
2007
74views more  JANCL 2007»
13 years 7 months ago
Operations on proofs and labels
Logic of proofs LP introduced by S. Artemov in 1995 describes properties of proof predicate “t is a proof of F” in the propositional language extended by atoms of the form [[t...
Tatiana Yavorskaya, Natalia Rubtsova
NIPS
2008
13 years 9 months ago
Designing neurophysiology experiments to optimally constrain receptive field models along parametric submanifolds
Sequential optimal design methods hold great promise for improving the efficiency of neurophysiology experiments. However, previous methods for optimal experimental design have in...
Jeremy Lewi, Robert J. Butera, David M. Schneider,...