Sciweavers

3864 search results - page 764 / 773
» time 2005
Sort
View
JAL
2006
101views more  JAL 2006»
13 years 7 months ago
Semi-matchings for bipartite graphs and load balancing
We consider the problem of fairly matching the left-hand vertices of a bipartite graph to the right-hand vertices. We refer to this problem as the optimal semimatching problem; it...
Nicholas J. A. Harvey, Richard E. Ladner, Lá...
CVIU
2007
154views more  CVIU 2007»
13 years 7 months ago
Smart particle filtering for high-dimensional tracking
Tracking articulated structures like a hand or body within a reasonable time is challenging because of the high dimensionality of the state space. Recently, a new optimization met...
Matthieu Bray, Esther Koller-Meier, Luc J. Van Goo...
DAM
2007
107views more  DAM 2007»
13 years 7 months ago
Eliminating graphs by means of parallel knock-out schemes
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex elim...
Hajo Broersma, Fedor V. Fomin, Rastislav Kralovic,...
JGAA
2006
100views more  JGAA 2006»
13 years 7 months ago
Orthogonal Hypergraph Drawing for Improved Visibility
Visualization of circuits is an important research area in electronic design automation. One commonly accepted method to visualize a circuit aligns the gates to layers and uses or...
Thomas Eschbach, Wolfgang Günther, Bernd Beck...
EJC
2007
13 years 7 months ago
Proof of the oval conjecture for planar partition functions
We prove that the translation plane and the shift plane defined by a planar partition function form an oval pair of projective planes in the sense that the planes share a line pe...
Nils Rosehr