Sciweavers

4378 search results - page 618 / 876
» On the Complexity of Ordered Colourings
Sort
View
CP
2006
Springer
15 years 10 months ago
Failure Analysis in Backtrack Search for Constraint Satisfaction
Abstract. Researchers have focused on assessing the quality of search algorithms by measuring effort, number of mistakes, runtime distributions and other characteristics. In this p...
Tudor Hulubei, Barry O'Sullivan
FQAS
2004
Springer
146views Database» more  FQAS 2004»
15 years 10 months ago
Discovering Representative Models in Large Time Series Databases
The discovery of frequently occurring patterns in a time series could be important in several application contexts. As an example, the analysis of frequent patterns in biomedical ...
Simona E. Rombo, Giorgio Terracina
CRYPTO
2006
Springer
125views Cryptology» more  CRYPTO 2006»
15 years 10 months ago
Automated Security Proofs with Sequences of Games
This paper presents the first automatic technique for proving not only protocols but also primitives in the exact security computational model. Automatic proofs of cryptographic pr...
Bruno Blanchet, David Pointcheval
CVPR
2006
IEEE
15 years 10 months ago
Accurate Tracking of Monotonically Advancing Fronts
A wide range of computer vision applications such as distance field computation, shape from shading, and shape representation require an accurate solution of a particular Hamilton...
M. Sabry Hassouna, Aly A. Farag
EMISA
2006
Springer
15 years 10 months ago
Challenges and Solutions in Planning Information Systems for Networked Value Constellations
: Nowadays businesses often decide to form networked value constellations in order to satisfy complex customer needs. To fulfill the value-based requirements of an e-Business idea ...
Novica Zarvic, Maya Daneva