1648 search results - page 97 / 330 » On the generation of bicliques of a graph |
157
click to vote
ICASSP
2011
IEEE
14 years 5 months ago
2011
IEEE
In this paper, we present a semi-automated method for converting conventional 2D images to stereoscopic 3D. User-defined strokes that correspond to a rough estimate of the depth ...
129
click to vote
ESA
2005
Springer
15 years 7 months ago
2005
Springer
We introduce a new way to compute common intervals of K permutations based on a very simple and general notion of generators of common intervals. This formalism leads to simple an...
111
click to vote
ICCS
1997
Springer
15 years 5 months ago
1997
Springer
Users need to be strongly involved in the specification process of network information systems. Characteristics of user-driven specification are described, and process composition ...
106
click to vote
FOCS
2004
IEEE
15 years 5 months ago
2004
IEEE
We study a simple Markov chain, known as the Glauber dynamics, for generating a random k-coloring of a n-vertex graph with maximum degree . We prove that, for every > 0, the d...
126
click to vote
ESA
2006
Springer
15 years 5 months ago
2006
Springer
We show that enumerating all minimal spanning and connected subsets of a given matroid is quasi-polynomially equivalent to the well-known hypergraph transversal problem, and thus ...