Sciweavers

886 search results - page 148 / 178
» Reasoning with contextual graphs
Sort
View
LICS
2008
IEEE
14 years 4 months ago
A Neutral Approach to Proof and Refutation in MALL
We propose a setting in which the search for a proof of B or a refutation of B (a proof of ¬B) can be carried out simultaneously: this is in contrast to the usual approach in aut...
Olivier Delande, Dale Miller
LICS
2008
IEEE
14 years 4 months ago
Winning Regions of Higher-Order Pushdown Games
In this paper we consider parity games defined by higher-order pushdown automata. These automata generalise pushdown automata by the use of higher-order stacks, which are nested ...
Arnaud Carayol, Matthew Hague, Antoine Meyer, C.-H...
SASO
2008
IEEE
14 years 4 months ago
Wanderer between the Worlds - Self-Organized Network Stability in Attack and Random Failure Scenarios
Many real–world networks show a scale–free degree distribution, a structure that is known to be very stable in case of random failures. Unfortunately, the very same structure ...
Katharina Anna Zweig, Karin Zimmermann
BIBE
2007
IEEE
145views Bioinformatics» more  BIBE 2007»
14 years 4 months ago
Homomorphisms of Multisource Trees into Networks with Applications to Metabolic Pathways
Network mapping is a convenient tool for comparing and exploring biological networks; it can be used for predicting unknown pathways, fast and meaningful searching of databases, a...
Qiong Cheng, Robert W. Harrison, Alexander Zelikov...
CRYPTO
2007
Springer
132views Cryptology» more  CRYPTO 2007»
14 years 3 months ago
How Should We Solve Search Problems Privately?
Abstract. Secure multiparty computation allows a group of distrusting parties to jointly compute a (possibly randomized) function of their inputs. However, it is often the case tha...
Amos Beimel, Tal Malkin, Kobbi Nissim, Enav Weinre...