Sciweavers

1389 search results - page 240 / 278
» Improved Approximation Algorithms for Label Cover Problems
Sort
View
ACCV
2006
Springer
15 years 3 months ago
Online Updating Appearance Generative Mixture Model for Meanshift Tracking
This paper proposes an appearance generative mixture model based on key frames for meanshift tracking. Meanshift tracking algorithm tracks object by maximizing the similarity betwe...
Jilin Tu, Hai Tao, Thomas S. Huang
SIGGRAPH
1993
ACM
15 years 2 months ago
Combining hierarchical radiosity and discontinuity meshing
We introduce a new approach for the computation of viewindependent solutions to the diffuse global illumination problem in polyhedral environments. The approach combines ideas fro...
Dani Lischinski, Filippo Tampieri, Donald P. Green...
ICML
2009
IEEE
15 years 10 months ago
Learning with structured sparsity
This paper investigates a new learning formulation called structured sparsity, which is a naturalextensionofthestandardsparsityconceptinstatisticallearningandcompressivesensing. B...
Junzhou Huang, Tong Zhang, Dimitris N. Metaxas
FOCS
2006
IEEE
15 years 4 months ago
Generalization of Binary Search: Searching in Trees and Forest-Like Partial Orders
We extend the binary search technique to searching in trees. We consider two models of queries: questions about vertices and questions about edges. We present a general approach t...
Krzysztof Onak, Pawel Parys
CPM
2004
Springer
107views Combinatorics» more  CPM 2004»
15 years 1 months ago
Sorting by Reversals in Subquadratic Time
The problem of sorting a signed permutation by reversals is inspired by genome rearrangements in computational molecular biology. Given two genomes represented as two signed permut...
Eric Tannier, Marie-France Sagot