Sciweavers

1493 search results - page 98 / 299
» Local resilience of graphs
Sort
View
JCO
2007
130views more  JCO 2007»
13 years 7 months ago
On edge orienting methods for graph coloring
We consider the problem of orienting the edges of a graph so that the length of a longest path in the resulting digraph is minimum. As shown by Gallai, Roy and Vitaver, this edge ...
Bernard Gendron, Alain Hertz, Patrick St-Louis
CVPR
2007
IEEE
14 years 10 months ago
Learning GMRF Structures for Spatial Priors
The goal of this paper is to find sparse and representative spatial priors that can be applied to part-based object localization. Assuming a GMRF prior over part configurations, w...
Lie Gu, Eric P. Xing, Takeo Kanade
WAOA
2010
Springer
232views Algorithms» more  WAOA 2010»
13 years 5 months ago
Approximation Algorithms for Domination Search
The r-domination search game on graphs is a game-theoretical approach to several graph and hypergraph parameters including treewidth and hypertree width. The task is to identify t...
Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thi...
SIAMCOMP
1998
111views more  SIAMCOMP 1998»
13 years 7 months ago
Computing the Local Consensus of Trees
The inference of consensus from a set of evolutionary trees is a fundamental problem in a number of fields such as biology and historical linguistics, and many models for inferrin...
Sampath Kannan, Tandy Warnow
CVPR
2010
IEEE
1413views Computer Vision» more  CVPR 2010»
14 years 4 months ago
Free-Shape Subwindow Search for Object Localization
Object localization in an image is usually handled by searching for an optimal subwindow that tightly covers the object of interest. However, the subwindows considered in previous ...
Zhiqi Zhang, Yu Cao, Dhaval Salvi, Kenton Oliver, ...