Sciweavers

2314 search results - page 372 / 463
» Minimal Partitions of a Graph
Sort
View
125
Voted
TSP
2010
14 years 10 months ago
Learning Gaussian tree models: analysis of error exponents and extremal structures
The problem of learning tree-structured Gaussian graphical models from independent and identically distributed (i.i.d.) samples is considered. The influence of the tree structure a...
Vincent Y. F. Tan, Animashree Anandkumar, Alan S. ...
334
Voted
COCOON
2011
Springer
14 years 3 months ago
Finding Paths with Minimum Shared Edges
Motivated by a security problem in geographic information systems, we study the following graph theoretical problem: given a graph G, two special nodes s and t in G, and a number k...
Masoud T. Omran, Jörg-Rüdiger Sack, Hami...
ICCV
2009
IEEE
16 years 8 months ago
Image Segmentation with A Bounding Box Prior
User-provided object bounding box is a simple and popular interaction paradigm considered by many existing interactive image segmentation frameworks. However, these frameworks t...
Victor Lempitsky, Pushmeet Kohli, Carsten Rother, ...
150
Voted
CVPR
2005
IEEE
16 years 5 months ago
Particle Filtering for Geometric Active Contours with Application to Tracking Moving and Deforming Objects
Geometric active contours are formulated in a manner which is parametrization independent. As such, they are amenable to representation as the zero level set of the graph of a hig...
Yogesh Rathi, Namrata Vaswani, Allen Tannenbaum, A...
106
Voted
WALCOM
2010
IEEE
290views Algorithms» more  WALCOM 2010»
15 years 10 months ago
The Covert Set-Cover Problem with Application to Network Discovery
We address a version of the set-cover problem where we do not know the sets initially (and hence referred to as covert) but we can query an element to find out which sets contain ...
Sandeep Sen, V. N. Muralidhara