Sciweavers

5624 search results - page 421 / 1125
» On Conditional Covering Problem
Sort
View
IWPEC
2009
Springer
16 years 1 months ago
What Makes Equitable Connected Partition Easy
We study the Equitable Connected Partition problem, which is the problem of partitioning a graph into a given number of partitions, such that each partition induces a connected sub...
Rosa Enciso, Michael R. Fellows, Jiong Guo, Iyad A...
APPROX
2008
Springer
184views Algorithms» more  APPROX 2008»
15 years 9 months ago
Approximately Counting Embeddings into Random Graphs
Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous res...
Martin Fürer, Shiva Prasad Kasiviswanathan
CVPR
2004
IEEE
16 years 9 months ago
Graphical Models for Graph Matching
This paper explores a formulation for attributed graph matching as an inference problem over a hidden Markov Random Field. We approximate the fully connected model with simpler mo...
Dante Augusto Couto Barone, Terry Caelli, Tib&eacu...
ICIP
2003
IEEE
16 years 8 months ago
A stokes flow boundary integral measurement of tubular structure cross sections in two dimensions
In this paper we will develop a method to determine cross sections of arbitrary two-dimensional tubular structures, which are allowed to branch, by means of a Stokes flow based bo...
Marc Niethammer, Eric Pichon, Allen Tannenbaum, Pe...
ICIP
2009
IEEE
16 years 8 months ago
Visual Tracking Of Object Silhouettes
In this paper we propose a new method that addresses the problem of tracking the bitmap (silhouette) of an object in a video under very general conditions. We assume a general tar...