Sciweavers

412 search results - page 20 / 83
» A New Proof of the F5 Algorithm
Sort
View
DM
1998
56views more  DM 1998»
14 years 9 months ago
Factoring cardinal product graphs in polynomial time
In this paper a polynomial algorithm for the prime factorization of finite, connected nonbipartite graphs with respect to the cardinal product is presented. This algorithm also d...
Wilfried Imrich
CAV
2012
Springer
231views Hardware» more  CAV 2012»
13 years 6 days ago
Incremental, Inductive CTL Model Checking
A SAT-based incremental, inductive algorithm for model checking CTL properties is proposed. As in classic CTL model checking, the parse graph of the property shapes the analysis. H...
Zyad Hassan, Aaron R. Bradley, Fabio Somenzi
CSFW
1999
IEEE
15 years 2 months ago
Athena: A New Efficient Automatic Checker for Security Protocol Analysis
We propose an efficient automatic checking algorithm, Athena, for analyzing security protocols. Athena incorporates a logic that can express security properties including authenti...
Dawn Xiaodong Song
CORR
2011
Springer
192views Education» more  CORR 2011»
14 years 4 months ago
Distribution-Independent Evolvability of Linear Threshold Functions
Valiant’s (2007) model of evolvability models the evolutionary process of acquiring useful functionality as a restricted form of learning from random examples. Linear threshold ...
Vitaly Feldman
INFOCOM
2007
IEEE
15 years 4 months ago
Randomized Decentralized Broadcasting Algorithms
— We consider the problem of broadcasting a live stream of data in an unstructured network. Broadcasting has been studied extensively for networks with capacity constraints at th...
Laurent Massoulié, Andrew Twigg, Christos G...