Sciweavers

412 search results - page 80 / 83
» A New Proof of the F5 Algorithm
Sort
View
BMCBI
2010
178views more  BMCBI 2010»
14 years 9 months ago
Applications of a formal approach to decipher discrete genetic networks
Background: A growing demand for tools to assist the building and analysis of biological networks exists in systems biology. We argue that the use of a formal approach is relevant...
Fabien Corblin, Eric Fanchon, Laurent Trilling
CCR
2010
184views more  CCR 2010»
14 years 9 months ago
Characterising temporal distance and reachability in mobile and online social networks
The analysis of social and technological networks has attracted a lot of attention as social networking applications and mobile sensing devices have given us a wealth of real data...
John Tang, Mirco Musolesi, Cecilia Mascolo, Vito L...
IJFCS
2006
110views more  IJFCS 2006»
14 years 9 months ago
Sat-based Model Checking for Region Automata
For successful software verification, model checkers must be capable of handling a large number of program variables. Traditional, BDD-based model checking is deficient in this re...
Fang Yu, Bow-Yaw Wang
JMIV
2006
185views more  JMIV 2006»
14 years 9 months ago
Intrinsic Statistics on Riemannian Manifolds: Basic Tools for Geometric Measurements
In medical image analysis and high level computer vision, there is an intensive use of geometric features like orientations, lines, and geometric transformations ranging from simp...
Xavier Pennec
COCO
2009
Springer
78views Algorithms» more  COCO 2009»
15 years 4 months ago
Fixed-Polynomial Size Circuit Bounds
—In 1982, Kannan showed that ΣP 2 does not have nk -sized circuits for any k. Do smaller classes also admit such circuit lower bounds? Despite several improvements of Kannan’s...
Lance Fortnow, Rahul Santhanam, Ryan Williams