4298 search results - page 53 / 860 » Measurable chromatic numbers |
162
click to vote
BMCBI
2008
15 years 6 months ago
2008
Background: A JavaTM application is presented, which compares large numbers (n > 100) of raw FTICR mass spectra from patients and controls. Two peptide profile matrices can be ...
151
click to vote
FOCS
2008
IEEE
16 years 23 days ago
2008
IEEE
The deletion–contraction algorithm is perhaps the most popular method for computing a host of fundamental graph invariants such as the chromatic, flow, and reliability polynomi...
161
click to vote
APPROX
2004
Springer
15 years 11 months ago
2004
Springer
A simple first moment argument shows that in a randomly chosen k-SAT formula with m clauses over n boolean variables, the fraction of satisfiable clauses is 1−2−k +o(1) as m/...
164
click to vote
ICALP
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. Given a family of subsets of an n-element universe, the kcover problem asks whether there are k sets in the family whose union contains the universe; in the k-packing pro...
182
click to vote
COCOON
2008
Springer
15 years 8 months ago
2008
Springer
In this paper, we consider a new visual cryptography scheme that allows for sharing of multiple secret images on graphs: we are given an arbitrary graph (V, E) where every node an...