Sciweavers

2609 search results - page 194 / 522
» Models for Global Constraint Applications
Sort
View
NIPS
1997
15 years 7 months ago
Graph Matching with Hierarchical Discrete Relaxation
Our aim in this paper is to develop a Bayesian framework for matching hierarchical relational models. Such models are widespread in computer vision. The framework that we adopt fo...
Richard C. Wilson, Edwin R. Hancock
CDC
2010
IEEE
142views Control Systems» more  CDC 2010»
15 years 1 months ago
Consensus with constrained convergence rate: Agreement in communities
The study focuses on a class of discrete-time multi-agent systems modelling opinion dynamics with decaying confidence. Essentially, we propose an agreement protocol that impose a p...
Constantin-Irinel Morarescu, Antoine Girard
ACSW
2007
15 years 8 months ago
Design Principles for Low Latency Anonymous Network Systems Secure against Timing Attacks
Low latency anonymous network systems, such as Tor, were considered secure against timing attacks when the threat model does not include a global adversary. In this threat model t...
Rungrat Wiangsripanawan, Willy Susilo, Reihaneh Sa...
CGF
2008
174views more  CGF 2008»
15 years 6 months ago
Particle Level Set Advection for the Interactive Visualization of Unsteady 3D Flow
Typically, flow volumes are visualized by defining their boundary as iso-surface of a level set function. Grid-based level sets offer a good global representation but suffer from ...
Nicolas Cuntz, Andreas Kolb, Robert Strzodka, Dani...
DAC
2003
ACM
16 years 7 months ago
An IDF-based trace transformation method for communication refinement
In the Artemis project [13], design space exploration of embedded systems is provided by modeling application behavior and architectural performance constraints separately. Mappin...
Andy D. Pimentel, Cagkan Erbas