Sciweavers

2109 search results - page 233 / 422
» Solving Necklace Constraint Problems
Sort
View
IANDC
2008
105views more  IANDC 2008»
15 years 6 months ago
Symbolic protocol analysis for monoidal equational theories
We are interested in the design of automated procedures for analyzing the (in)security of cryptographic protocols in the Dolev-Yao model for a bounded number of sessions when we t...
Stéphanie Delaune, Pascal Lafourcade, Denis...
179
Voted
JVCA
2007
128views more  JVCA 2007»
15 years 6 months ago
Impulse-based dynamic simulation in linear time
This paper describes an impulse-based dynamic simulation method for articulated bodies which has a linear time complexity. Existing linear-time methods are either based on a reduc...
Jan Bender
147
Voted
ICCV
2009
IEEE
16 years 11 months ago
Efficient Discriminative Learning of Parts-based Models
Supervised learning of a parts-based model can be for- mulated as an optimization problem with a large (exponen- tial in the number of parts) set of constraints. We show how thi...
M. Pawan Kumar, Andrew Zisserman, Philip H.S. Torr
GLOBECOM
2008
IEEE
16 years 17 days ago
Comparison of Routing and Wavelength Assignment Algorithms in WDM Networks
- We design and implement various algorithms for solving the static RWA problem with the objective of minimizing the maximum number of requested wavelengths based on LP relaxation ...
Kostas Christodoulopoulos, Konstantinos Manousakis...
137
Voted
SAC
2005
ACM
15 years 11 months ago
Limited assignments: a new cutoff strategy for incomplete depth-first search
In this paper, we propose an extension of three incomplete depthfirst search techniques, namely depth-bounded backtrack search, credit search, and iterative broadening, towards pr...
Roman Barták, Hana Rudová