Sciweavers

3715 search results - page 81 / 743
» A Space Optimization for FP-Growth
Sort
View
COLT
2010
Springer
13 years 6 months ago
Convex Games in Banach Spaces
We study the regret of an online learner playing a multi-round game in a Banach space B against an adversary that plays a convex function at each round. We characterize the minima...
Karthik Sridharan, Ambuj Tewari
CVPR
2007
IEEE
14 years 10 months ago
Efficient Sampling of Disparity Space for Fast And Accurate Matching
A simple stereo matching algorithm is proposed that visits only a small fraction of disparity space in order to find a semi-dense disparity map. It works by growing from a small s...
Jan Cech, Radim Sára
ICIP
2009
IEEE
14 years 9 months ago
Localized Null Space Representation For Dynamic Updating And Downdating In Image And Video Databases
Event/object classification and recognition is an extremely challenging problem, particularly when the query or stored data undergo an affine transformation due to camera motion. ...
GECCO
2005
Springer
228views Optimization» more  GECCO 2005»
14 years 1 months ago
Applying metaheuristic techniques to search the space of bidding strategies in combinatorial auctions
Many non-cooperative settings that could potentially be studied using game theory are characterized by having very large strategy spaces and payoffs that are costly to compute. Be...
Ashish Sureka, Peter R. Wurman
EVOW
2003
Springer
14 years 1 months ago
Search Space Analysis of the Linear Ordering Problem
Abstract. The Linear Ordering Problem (LOP) is an NP-hard combinatorial optimization problem that arises in a variety of applications and several algorithmic approaches to its solu...
Tommaso Schiavinotto, Thomas Stützle