Results 1  10
of
484
The pyramid match kernel: Discriminative classification with sets of image features
 IN ICCV
, 2005
"... Discriminative learning is challenging when examples are sets of features, and the sets vary in cardinality and lack any sort of meaningful ordering. Kernelbased classification methods can learn complex decision boundaries, but a kernel over unordered set inputs must somehow solve for correspondenc ..."
Abstract

Cited by 544 (29 self)
 Add to MetaCart
for correspondences – generally a computationally expensive task that becomes impractical for large set sizes. We present a new fast kernel function which maps unordered feature sets to multiresolution histograms and computes a weighted histogram intersection in this space. This “pyramid match” computation is linear
Classification using Intersection Kernel Support Vector Machines is Efficient ∗
"... Straightforward classification using kernelized SVMs requires evaluating the kernel for a test vector and each of the support vectors. For a class of kernels we show that one can do this much more efficiently. In particular we show that one can build histogram intersection kernel SVMs (IKSVMs) with ..."
Abstract

Cited by 256 (10 self)
 Add to MetaCart
Straightforward classification using kernelized SVMs requires evaluating the kernel for a test vector and each of the support vectors. For a class of kernels we show that one can do this much more efficiently. In particular we show that one can build histogram intersection kernel SVMs (IKSVMs
Efficient collision detection using bounding volume hierarchies of kdops
 IEEE Transactions on Visualization and Computer Graphics
, 1998
"... Abstract—Collision detection is of paramount importance for many applications in computer graphics and visualization. Typically, the input to a collision detection algorithm is a large number of geometric objects comprising an environment, together with a set of objects moving within the environment ..."
Abstract

Cited by 290 (4 self)
 Add to MetaCart
and of the environment. Our algorithms have been implemented and tested. We provide experimental evidence showing that our approach yields substantially faster collision detection than previous methods. Index Terms—Collision detection, intersection searching, bounding volume hierarchies, discrete orientation polytopes
Characterizing Matchings as the Intersection of Matroids
, 2003
"... This paper deals with the problem of representing the matching independence system in a graph as the intersection of finitely many matroids. After characterizing the graphs for which the matching independence system is the intersection of two matroids, we study the function µ(G), which is the minimu ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
This paper deals with the problem of representing the matching independence system in a graph as the intersection of finitely many matroids. After characterizing the graphs for which the matching independence system is the intersection of two matroids, we study the function µ(G), which
MATROID INTERSECTION WITH PRIORITY CONSTRAINTS
, 2013
"... In this paper, we consider the following variant of the matroid intersection problem. We are given two matroids M1,M2 on the same ground set E and a subset A of E. Our goal is to find a common independent set I ofM1,M2 such that I ∩A  is maximum among all common independent sets ofM1,M2 and such ..."
Abstract
 Add to MetaCart
In this paper, we consider the following variant of the matroid intersection problem. We are given two matroids M1,M2 on the same ground set E and a subset A of E. Our goal is to find a common independent set I ofM1,M2 such that I ∩A  is maximum among all common independent sets ofM1,M2
Matroids with an infinite circuitcocircuit intersection
"... We construct some matroids that have a circuit and a cocircuit with infinite intersection. This answers a question of Bruhn, Diestel, Kriesell, Pendavingh and Wollan. It further shows that the axiom system for matroids proposed by Dress in 1986 does not axiomatize all infinite matroids. We show that ..."
Abstract

Cited by 6 (5 self)
 Add to MetaCart
We construct some matroids that have a circuit and a cocircuit with infinite intersection. This answers a question of Bruhn, Diestel, Kriesell, Pendavingh and Wollan. It further shows that the axiom system for matroids proposed by Dress in 1986 does not axiomatize all infinite matroids. We show
Nonlinear optimization for matroid intersection and extensions
, 2008
"... We address optimization of nonlinear functions of the form f(Wx) , where f: R d → R is a nonlinear function, W is a d × n matrix, and feasible x are in some large finite set F of integer points in R n. Generally, such problems are intractable, so we obtain positive algorithmic results by looking a ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
trees, assignments, matroids, polymatroids, etc. to nonlinear optimization over such structures. We assume that the convex hull of F is welldescribed by linear inequalities (i.e., we have an efficient separation oracle). For example, the set of characteristic vectors of common bases of a pair
The complexity of maximum matroidgreedoid intersection
 DISCRETE APPL. MATH
, 2006
"... The maximum intersection problem for a matroid and a greedoid, given by polynomialtime oracles, is shown NPhard by expressing the satisfiability of boolean formulas in 3conjunctive normal form as such an intersection. Also the corresponding approximation problem is shown NPhard for certain app ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
The maximum intersection problem for a matroid and a greedoid, given by polynomialtime oracles, is shown NPhard by expressing the satisfiability of boolean formulas in 3conjunctive normal form as such an intersection. Also the corresponding approximation problem is shown NPhard for certain
Results 1  10
of
484