Sciweavers

2850 search results - page 401 / 570
» On Timed Models and Full Abstraction
Sort
View
TAMC
2007
Springer
16 years 21 days ago
Approximately Optimal Trees for Group Key Management with Batch Updates
Abstract. We investigate the group key management problem for broadcasting applications. Previous work showed that, in handling key updates, batch rekeying can be more cost-effect...
Minming Li, Ze Feng, Ronald L. Graham, Frances F. ...
PADS
2006
ACM
16 years 16 days ago
Analysing the Performance of Optimistic Synchronisation Algorithms in Simulations of Multi-Agent Systems
In this paper we present a detailed analysis of the performance of the Decision Theoretic Read Delay (DTRD) optimistic synchronisation algorithm for simulations of Multistems. We ...
Michael Lees, Brian Logan, Dan Chen, Ton Oguara, G...
AMR
2005
Springer
88views Multimedia» more  AMR 2005»
16 years 4 days ago
Context-Based Image Similarity Queries
Abstract. In this paper an effective context-based approach for interactive similarity queries is presented. By exploiting the notion of image “context”, it is possible to asso...
Ilaria Bartolini
ECCV
2004
Springer
15 years 12 months ago
Multi-model Component-Based Tracking Using Robust Information Fusion
Abstract. One of the most difficult aspects of visual object tracking is the handling of occlusions and target appearance changes due to variations in illumination and viewing dir...
Bogdan Georgescu, Dorin Comaniciu, Tony X. Han, Xi...
ECAI
2006
Springer
15 years 10 months ago
Automatic Generation of Implied Constraints
Abstract. A well-known difficulty with solving Constraint Satisfaction Problems (CSPs) is that, while one formulation of a CSP may enable a solver to solve it quickly, a different ...
John Charnley, Simon Colton, Ian Miguel