Sciweavers

317 search results - page 2 / 64
» Factoring logic functions using graph partitioning
Sort
View
COMBINATORICS
2002
85views more  COMBINATORICS 2002»
13 years 5 months ago
Parking Functions of Types A and B
The lattice of noncrossing partitions can be embedded into the Cayley graph of the symmetric group. This allows us to rederive connections between noncrossing partitions and parki...
Philippe Biane
BIBM
2008
IEEE
175views Bioinformatics» more  BIBM 2008»
13 years 11 months ago
Integrative Protein Function Transfer Using Factor Graphs and Heterogeneous Data Sources
We propose a novel approach for predicting protein functions of an organism by coupling sequence homology and PPI data between two (or more) species with multifunctional Gene Onto...
Antonina Mitrofanova, Vladimir Pavlovic, Bud Mishr...
IJCAI
2001
13 years 6 months ago
Solving Factored MDPs via Non-Homogeneous Partitioning
This paper describes an algorithm for solving large state-space MDPs (represented as factored MDPs) using search by successive refinement in the space of non-homogeneous partition...
Kee-Eung Kim, Thomas Dean
JMMA
2010
162views more  JMMA 2010»
13 years 2 days ago
Co-clustering Documents and Words by Minimizing the Normalized Cut Objective Function
This paper follows a word-document co-clustering model independently introduced in 2001 by several authors such as I.S. Dhillon, H. Zha and C. Ding. This model consists in creatin...
Charles-Edmond Bichot
ICPP
1995
IEEE
13 years 8 months ago
Multilevel Graph Partitioning Schemes
– In this paper we present experiments with a class of graph partitioning algorithms that reduce the size of the graph by collapsing vertices and edges, partition the smaller gra...
George Karypis, Vipin Kumar