Sciweavers

315 search results - page 19 / 63
» Eigenvalue bounds for independent sets
Sort
View
FM
2009
Springer
124views Formal Methods» more  FM 2009»
14 years 4 months ago
An Incremental Approach to Scope-Bounded Checking Using a Lightweight Formal Method
We present a novel approach to optimize scope-bounded checking programs using a relational constraint solver. Given a program and its correctness specification, the traditional app...
Danhua Shao, Sarfraz Khurshid, Dewayne E. Perry
CP
2008
Springer
13 years 11 months ago
A Branch and Bound Algorithm for Numerical MAX-CSP
The Constraint Satisfaction Problem (CSP) framework allows users to define problems in a declarative way, quite independently from the solving process. However, when the problem i...
Jean-Marie Normand, Alexandre Goldsztejn, Marc Chr...
GC
2002
Springer
13 years 9 months ago
Ramsey-Type Results for Unions of Comparability Graphs
Given a graph on n vertices which is the union of two comparability graphs on the same vertex set, it always contains a clique or independent set of size n 1 3 . On the other hand...
Adrian Dumitrescu, Géza Tóth
TCS
2008
13 years 9 months ago
Setting port numbers for fast graph exploration
We consider the problem of periodic graph exploration by a finite automaton in which an automaton with a constant number of states has to explore all unknown anonymous graphs of a...
David Ilcinkas
SSDBM
2010
IEEE
188views Database» more  SSDBM 2010»
14 years 2 months ago
Similarity Estimation Using Bayes Ensembles
Similarity search and data mining often rely on distance or similarity functions in order to provide meaningful results and semantically meaningful patterns. However, standard dist...
Tobias Emrich, Franz Graf, Hans-Peter Kriegel, Mat...