Sciweavers

223 search results - page 45 / 45
» Novel View Specification and Synthesis
Sort
View
MOR
2002
94views more  MOR 2002»
13 years 4 months ago
The Complexity of Generic Primal Algorithms for Solving General Integer Programs
ngly better objective function value until an optimal solution is reached. From an abstract point of view, an augmentation problem is solved in each iteration. That is, given a fea...
Andreas S. Schulz, Robert Weismantel
PAMI
2007
217views more  PAMI 2007»
13 years 4 months ago
Discriminative Learning and Recognition of Image Set Classes Using Canonical Correlations
—We address the problem of comparing sets of images for object recognition, where the sets may represent variations in an object’s appearance due to changing camera pose and li...
Tae-Kyun Kim, Josef Kittler, Roberto Cipolla
IWPEC
2010
Springer
13 years 2 months ago
On the Kernelization Complexity of Colorful Motifs
The Colorful Motif problem asks if, given a vertex-colored graph G, there exists a subset S of vertices of G such that the graph induced by G on S is connected and contains every c...
Abhimanyu M. Ambalath, Radheshyam Balasundaram, Ch...