194 search results - page 8 / 39 » The Polytope of Degree Partitions |
ASPDAC
2006
ACM
15 years 5 months ago
2006
ACM
We propose a methodology for optimal k-way partitioning with replication of directed hypergraphs via Boolean satisfiability. We begin by leveraging the power of existing and emerg...
JGT
2007
14 years 11 months ago
2007
: Let G be a graph with maximum degree d ≥ 3 and ω(G) ≤ d, where ω(G) is the clique number of the graph G. Let p1 and p2 be two positive integers such that d = p1 + p2. In th...
104
click to vote
ICAT
2007
IEEE
15 years 6 months ago
2007
IEEE
Partitioning constitutes one of the most critical challenges a distributed virtual environment needs to handle and is related to the efficient assignment of the existing entities ...
146
click to vote
ICPP
1995
IEEE
15 years 3 months ago
1995
IEEE
– 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...
110
click to vote
CVPR
2001
IEEE
16 years 1 months ago
2001
IEEE
Particle filters have proven to be an effective tool for visual tracking in non-gaussian, cluttered environments. Conventional particle filters however do not scale to the problem...