Sciweavers

304 search results - page 28 / 61
» Solving Generalized Small Inverse Problems
Sort
View
AUTOMATICA
2007
72views more  AUTOMATICA 2007»
13 years 7 months ago
A probabilistic analytic center cutting plane method for feasibility of uncertain LMIs
ust control problems can be formulated in abstract form as convex feasibility programs, where one seeks a solution x that satisfies a set of inequalities of the form F . = {f (x,...
Giuseppe C. Calafiore, Fabrizio Dabbene
ICCV
2003
IEEE
14 years 9 months ago
Multiview Reconstruction of Space Curves
Is the real problem in resolving correspondence using current stereo algorithms the lack of the "right" matching criterion? In studying the related task of reconstructin...
Fredrik Kahl, Jonas August
GECCO
2008
Springer
135views Optimization» more  GECCO 2008»
13 years 8 months ago
Context-dependent predictions and cognitive arm control with XCSF
While John Holland has always envisioned learning classifier systems (LCSs) as cognitive systems, most work on LCSs has focused on classification, datamining, and function appro...
Martin V. Butz, Oliver Herbort
SODA
1996
ACM
121views Algorithms» more  SODA 1996»
13 years 9 months ago
Optimal Placement of Convex Polygons to Maximize Point Containment
Given a convex polygon P with m vertices and a set S of n points in the plane, we consider the problem of nding a placement of P that contains the maximum number of points in S. W...
Matthew Dickerson, Daniel Scharstein
ARC
2010
Springer
387views Hardware» more  ARC 2010»
14 years 2 months ago
Optimising Memory Bandwidth Use for Matrix-Vector Multiplication in Iterative Methods
Computing the solution to a system of linear equations is a fundamental problem in scientific computing, and its acceleration has drawn wide interest in the FPGA community [1–3]...
David Boland, George A. Constantinides