Sciweavers

1486 search results - page 121 / 298
» Algorithms for two-box covering
Sort
View

Book
357views
17 years 5 months ago
Foundations of Constraint Satisfaction
"Constraint satisfaction is a general problem in which the goal is to find values for a set of variables that will satisfy a given set of constraints. It is the core of many a...
Edward Tsang
IH
2009
Springer
16 years 1 months ago
Estimating Steganographic Fisher Information in Real Images
This paper is concerned with the estimation of steganographic capacity in digital images, using information theoretic bounds and very large-scale experiments to approximate the dis...
Andrew D. Ker
SIGCSE
2004
ACM
100views Education» more  SIGCSE 2004»
16 years 6 days ago
A visual and interactive automata theory course with JFLAP 4.0
We describe the instructional software JFLAP 4.0 and how it can be used to provide a hands-on formal languages and automata theory course. JFLAP 4.0 doubles the number of chapters...
Ryan Cavalcante, Thomas Finley, Susan H. Rodger
SCALESPACE
2001
Springer
15 years 11 months ago
Generic Multi-scale Segmentation and Curve Approximation Method
Abstract. We propose a new complete method to extract significant description(s) of planar curves according to constant curvature segments. This method is based (i) on a multi-sca...
Marielle Mokhtari, Robert Bergevin
DSD
2004
IEEE
126views Hardware» more  DSD 2004»
15 years 10 months ago
Boolean Minimizer FC-Min: Coverage Finding Process
This paper describes principles of a novel two-level multi-output Boolean minimizer FC-Min, namely its Find Coverage phase. The problem of Boolean minimization is approached in a ...
Petr Fiser, Hana Kubatova