Sciweavers

252 search results - page 44 / 51
» Decremental Clique Problem
Sort
View
ATMOS
2007
119views Optimization» more  ATMOS 2007»
14 years 11 months ago
Models for Railway Track Allocation
The optimal track allocation problem (OPTRA) is to find, in a given railway network, a conflict free set of train routes of maximum value. We study two types of integer programmi...
Ralf Borndörfer, Thomas Schlechte
IPL
2007
94views more  IPL 2007»
14 years 9 months ago
A note on the Hadwiger number of circular arc graphs
Abstract. The intention of this note is to motivate the researchers to study Hadwiger’s conjecture for circular arc graphs. Let η(G) denote the largest clique minor of a graph G...
N. S. Narayanaswamy, Naveen Belkale, L. Sunil Chan...
SIAMDM
2010
131views more  SIAMDM 2010»
14 years 4 months ago
On Optimal Strategies for a Hat Game on Graphs
The following problem was introduced by Marcin Krzywkowski as a generalization of a problem of Todd Ebert. After initially coordinating a strategy, n players each occupy a differe...
Uriel Feige

Book
5396views
16 years 8 months ago
Markov Random Field Modeling in Computer Vision
Markov random field (MRF) theory provides a basis for modeling contextual constraints in visual processing and interpretation. It enables us to develop optimal vision algorithms sy...
Stan Z. Li
CVPR
2007
IEEE
15 years 11 months ago
Beyond Local Appearance: Category Recognition from Pairwise Interactions of Simple Features
We present a discriminative shape-based algorithm for object category localization and recognition. Our method learns object models in a weakly-supervised fashion, without requiri...
Marius Leordeanu, Martial Hebert, Rahul Sukthankar