55 search results - page 10 / 11 » orl 2008 |
ORL
2008
14 years 11 months ago
2008
We consider the problem to sell items to a set of bidders. Bidders bid on bundles of items, and each item's availability is unbounded, like for digital goods. We need to dete...
ORL
2008
14 years 11 months ago
2008
By analogy with the conjecture of Hirsch, we conjecture that the order of the largest total curvature of the central path associated to a polytope is the number of inequalities de...
97
Voted
ORL
2008
14 years 11 months ago
2008
We define a generalized variant of the satisfiability problem (SAT) where each "clause" is an or-list of inequalities in n variables. The inequality satisfiability probl...
120
click to vote
IPCV
2008
15 years 12 days ago
2008
Linear Discriminant Analysis(LDA) is well-known scheme for feature extraction and dimension reduction. It has been used widely in many applications involving high-dimensional data,...
ICPR
2008
IEEE
16 years 5 days ago
2008
IEEE
We present a new method for compact representation of large image datasets. Our method is based on treating small patches from an image as matrices as opposed to the conventional ...