Sciweavers

1523 search results - page 148 / 305
» The Computational Complexity of Linear Optics
Sort
View
DAM
2006
78views more  DAM 2006»
13 years 10 months ago
Hybrid rounding techniques for knapsack problems
We address the classical knapsack problem and a variant in which an upper bound is imposed on the number of items that can be selected. We show that appropriate combinations of ro...
Monaldo Mastrolilli, Marcus Hutter
JDCTA
2010
272views more  JDCTA 2010»
13 years 5 months ago
Optimal Control of Nonlinear Systems Using the Homotopy Perturbation Method: Infinite Horizon Case
This paper presents a new method for solving a class of infinite horizon nonlinear optimal control problems. In this method, first the original optimal control problem is transfor...
Amin Jajarmi, Hamidreza Ramezanpour, Arman Sargolz...
CVPR
2012
IEEE
12 years 18 days ago
Saliency filters: Contrast based filtering for salient region detection
Saliency estimation has become a valuable tool in image processing. Yet, existing approaches exhibit considerable variation in methodology, and it is often difficult to attribute...
Federico Perazzi, Philipp Krähenbühl, Ya...
SCA
2007
14 years 17 days ago
Smooth movers: perceptually guided human motion simulation
To animate a character, a number of poses are displayed in quick succession in order to create the illusion of motion. For most real-time applications, such as games, the pose upd...
Rachel McDonnell, Fiona N. Newell, Carol O'Sulliva...
ICPR
2004
IEEE
14 years 11 months ago
On Classifier Domains of Competence
We study the domain of dominant competence of six popular classifiers in a space of data complexity measurements. We observe that the simplest classifiers, nearest neighbor and li...
Ester Bernadó i Mansilla, Tin Kam Ho