Sciweavers

1952 search results - page 153 / 391
» Complete partitions of graphs
Sort
View
ICCD
2002
IEEE
101views Hardware» more  ICCD 2002»
16 years 1 months ago
Improving the Efficiency of Circuit-to-BDD Conversion by Gate and Input Ordering
Boolean functions are fundamental to synthesis and verification of digital logic, and compact representations of Boolean functions have great practical significance. Popular repre...
Fadi A. Aloul, Igor L. Markov, Karem A. Sakallah
171
Voted
CVPR
2003
IEEE
15 years 10 months ago
Graph-Theoretic Approach to Clustering and Segmentation
We develop a framework for the image segmentation problem based on a new graph-theoretic formulation of clustering. The approach is motivated by the analogies between the intuitiv...
Massimiliano Pavan, Marcello Pelillo
TCBB
2011
14 years 11 months ago
Graph Comparison by Log-Odds Score Matrices with Application to Protein Topology Analysis
A TOPS diagram is a simplified description of the topology of a protein using a graph where nodes are α-helices and β-strands, and edges correspond to chirality relations and p...
J. Rocha
DCC
2005
IEEE
16 years 4 months ago
The Combinatorics of Dom de Caen
We give an overview of some of the mathematical results of Dominique de Caen. These include a short proof of K?onig's theorem, results on Tur?an numbers, biclique partitions,...
Edwin R. van Dam
137
Voted
INFOCOM
2009
IEEE
15 years 11 months ago
A Social Network Based Patching Scheme for Worm Containment in Cellular Networks
Abstract—Recently, cellular phone networks have begun allowing third-party applications to run over certain open-API phone operating systems such as Windows Mobile, Iphone and Go...
Zhichao Zhu, Guohong Cao, Sencun Zhu, Supranamaya ...