1632 search results - page 27 / 327 » On special numberings of hypergraphs |
178
click to vote
ICCV
2007
IEEE
16 years 15 days ago
2007
IEEE
We consider clustering situations in which the pairwise affinity between data points depends on a latent ”context” variable. For example, when clustering features arising fro...
171
click to vote
VL
2005
IEEE
15 years 11 months ago
2005
IEEE
On one hand, visual modeling languages are often used today in engineering domains, Mathworks’ Simulink/Stateflow for simulation, signal processing and controls being the prime ...
174
click to vote
DAGSTUHL
2006
15 years 7 months ago
2006
We consider the computational complexity of producing the best possible offspring in a crossover, given two solutions of the parents. The crossover operators are studied on the cla...
153
click to vote
IPCO
2004
15 years 7 months ago
2004
We consider the problems of enumerating all minimal strongly connected subgraphs and all minimal dicuts of a given directed graph G = (V, E). We show that the first of these proble...
126
click to vote
ESA
2010
Springer
15 years 7 months ago
2010
Springer
abstract appeared in Proc. 24th Annual Symposium of Computational Geometry (SoCG), 2008, pp. 338-345. S. Shannigrahi and S. P. Pal, "Efficient Prufer-like Coding and Counting ...