Sciweavers

285 search results - page 33 / 57
» Relating two formal models of path-vector routing
Sort
View
87
Voted
FROCOS
2007
Springer
15 years 3 months ago
Combining Algorithms for Deciding Knowledge in Security Protocols
Abstract. In formal approaches, messages sent over a network are usually modeled by terms together with an equational theory, axiomatizing the properties of the cryptographic funct...
Mathilde Arnaud, Véronique Cortier, St&eacu...
COORDINATION
2006
Springer
15 years 1 months ago
Atomic Commit and Negotiation in Service Oriented Computing
In this paper we investigate the relationship between two problems, related to distributed systems, that are of particular interest in the context of Service Oriented Computing: at...
Laura Bocchi, Roberto Lucchi
CVPR
2008
IEEE
15 years 3 months ago
General Constraints for Batch Multiple-Target Tracking Applied to Large-Scale Videomicroscopy
While there is a large class of Multiple-Target Tracking (MTT) problems for which batch processing is possible and desirable, batch MTT remains relatively unexplored in comparis...
Kevin Smith, Alan Carleton, Vincent Lepetit
IANDC
2000
64views more  IANDC 2000»
14 years 9 months ago
Bisimilarity of Open Terms
The standard way of lifting a binary relation, R, from closed terms of an algebra to open terms is to de ne its closed-instance extension, Rci, which holds for a given pair of ope...
Arend Rensink
CN
2004
150views more  CN 2004»
14 years 9 months ago
Optimizing interconnection policies
There are two basic types of interconnection agreements between providers in the Internet: peering and transit. A decision every Internet network service provider (INSP) has to ma...
Oliver Heckmann, Jens Schmitt, Ralf Steinmetz