Sciweavers

765 search results - page 143 / 153
» Graph Coloring with Rejection
Sort
View
ECOOP
1997
Springer
14 years 23 days ago
Near Optimal Hierarchical Encoding of Types
A type inclusion test is a procedure to decide whether two types are related by a given subtyping relationship. An efficient implementation of the type inclusion test plays an impo...
Andreas Krall, Jan Vitek, R. Nigel Horspool
EVOW
2010
Springer
14 years 18 days ago
Ant Colony Optimization for Tree Decompositions
Instances of constraint satisfaction problems can be solved efficiently if they are representable as a tree decomposition of small width. Unfortunately, the task of finding a deco...
Thomas Hammerl, Nysret Musliu
ATAL
2006
Springer
14 years 10 days ago
No-commitment branch and bound search for distributed constraint optimization
We present a new polynomial-space algorithm for solving Distributed Constraint Optimization problems (DCOP). The algorithm, called NCBB, is branch and bound search with modificati...
Anton Chechetka, Katia P. Sycara
CVPR
2004
IEEE
14 years 10 days ago
Efficient Graphical Models for Processing Images
Graphical models are powerful tools for processing images. However, the large dimensionality of even local image data poses a difficulty: representing the range of possible graphi...
Marshall F. Tappen, Bryan C. Russell, William T. F...
CRYPTO
2006
Springer
92views Cryptology» more  CRYPTO 2006»
14 years 10 days ago
Rigorous Bounds on Cryptanalytic Time/Memory Tradeoffs
In this paper we formalize a general model of cryptanalytic time/memory tradeoffs for the inversion of a random function f : {0, 1, . . . , N - 1} {0, 1, . . . , N - 1}. The model...
Elad Barkan, Eli Biham, Adi Shamir