Sciweavers

1380 search results - page 144 / 276
» Computing the optimal strategy to commit to
Sort
View
AIR
2004
111views more  AIR 2004»
13 years 7 months ago
Towards Fast Vickrey Pricing using Constraint Programming
Ensuring truthfulness amongst self-interested agents bidding against one another in an auction can be computationally expensive when prices are determined using the Vickrey-Clarke-...
Alan Holland, Barry O'Sullivan
ICCV
2007
IEEE
14 years 10 months ago
Boosting Invariance and Efficiency in Supervised Learning
In this paper we present a novel boosting algorithm for supervised learning that incorporates invariance to data transformations and has high generalization capabilities. While on...
Andrea Vedaldi, Paolo Favaro, Enrico Grisan
ISPAN
1997
IEEE
14 years 5 days ago
A Parallel Pipelined Renderer for Time-Varying Volume Data
This paper presents a strategy for efficiently rendering time-varying volume data on a distributed-memory parallel computer. Visualizing time-varying volume data take both large s...
Tzi-cker Chiueh, Kwan-Liu Ma
GECCO
2005
Springer
129views Optimization» more  GECCO 2005»
14 years 1 months ago
Real-coded crossover as a role of kernel density estimation
This paper presents a kernel density estimation method by means of real-coded crossovers. Estimation of density algorithms (EDAs) are evolutionary optimization techniques, which d...
Jun Sakuma, Shigenobu Kobayashi
CVPR
2006
IEEE
14 years 10 months ago
A Design Principle for Coarse-to-Fine Classification
Coarse-to-fine classification is an efficient way of organizing object recognition in order to accommodate a large number of possible hypotheses and to systematically exploit shar...
Sachin Gangaputra, Donald Geman