Sciweavers

1225 search results - page 170 / 245
» The Instance Complexity Conjecture
Sort
View
LPAR
2007
Springer
14 years 3 months ago
Verifying Cryptographic Protocols with Subterms Constraints
Many analysis techniques and decidability results have been obtained for cryptographic protocols. However all of them consider protocols with limited procedures for the processing ...
Yannick Chevalier, Denis Lugiez, Michaël Rusi...
SPIN
2007
Springer
14 years 3 months ago
Towards Model Checking Spatial Properties with SPIN
Abstract. We present an approach for the verication of spatial properties with Spin. We rst extend one of Spin's main property specication mechanisms, i.e., the linear-time...
Alberto Lluch-Lafuente
WAW
2007
Springer
144views Algorithms» more  WAW 2007»
14 years 3 months ago
Approximating Betweenness Centrality
Betweenness is a centrality measure based on shortest paths, widely used in complex network analysis. It is computationally-expensive to exactly determine betweenness; currently th...
David A. Bader, Shiva Kintali, Kamesh Madduri, Mil...
DSD
2006
IEEE
110views Hardware» more  DSD 2006»
14 years 3 months ago
A Graph Based Algorithm for Data Path Optimization in Custom Processors
The rising complexity, customization and short time to market of modern digital systems requires automatic methods for generation of high performance architectures for such system...
Jelena Trajkovic, Mehrdad Reshadi, Bita Gorjiara, ...
ICPADS
2006
IEEE
14 years 3 months ago
Experiences with Simulations - A Light and Fast Model for Secure Web Applications
Using simulations of a complex system such as a Web Application Server provides us with a tool that allows the running of tests without using the resources needed in a real system...
Ramon Nou, Jordi Guitart, David Carrera, Jordi Tor...