Sciweavers

80 search results - page 4 / 16
» A fast cost scaling algorithm for submodular flow
Sort
View
CVPR
2008
IEEE
14 years 9 months ago
Learning and using taxonomies for fast visual categorization
The computational complexity of current visual categorization algorithms scales linearly at best with the number of categories. The goal of classifying simultaneously Ncat = 104 -...
Gregory Griffin, Darya Perona
CORR
2010
Springer
167views Education» more  CORR 2010»
13 years 7 months ago
Network Flow Algorithms for Structured Sparsity
We consider a class of learning problems that involve a structured sparsityinducing norm defined as the sum of -norms over groups of variables. Whereas a lot of effort has been pu...
Julien Mairal, Rodolphe Jenatton, Guillaume Obozin...
CPAIOR
2009
Springer
14 years 2 months ago
Optimal Interdiction of Unreactive Markovian Evaders
The interdiction problem arises in a variety of areas including military logistics, infectious disease control, and counter-terrorism. In the typical formulation of network interdi...
Alexander Gutfraind, Aric A. Hagberg, Feng Pan
VIS
2007
IEEE
239views Visualization» more  VIS 2007»
14 years 8 months ago
Moment Invariants for the Analysis of 2D Flow Fields
We present a novel approach for analyzing two-dimensional (2D) flow field data based on the idea of invariant moments. Moment invariants have traditionally been used in computer vi...
Michael Schlemmer, Manuel Heringer, Florian Morr...
PLDI
2000
ACM
13 years 11 months ago
Off-line variable substitution for scaling points-to analysis
Most compiler optimizations and software productivity tools rely on information about the effects of pointer dereferences in a program. The purpose of points-to analysis is to com...
Atanas Rountev, Satish Chandra