Sciweavers

6315 search results - page 23 / 1263
» Approximating Solution Structure
Sort
View
122
Voted
SODA
1993
ACM
202views Algorithms» more  SODA 1993»
15 years 2 months ago
Approximate Nearest Neighbor Queries in Fixed Dimensions
Given a set of n points in d-dimensional Euclidean space, S ⊂ Ed , and a query point q ∈ Ed , we wish to determine the nearest neighbor of q, that is, the point of S whose Euc...
Sunil Arya, David M. Mount
93
Voted
JCAM
2011
91views more  JCAM 2011»
14 years 3 months ago
Numerical solution of linear Volterra integral equations of the second kind with sharp gradients
Collocation methods are a well developed approach for the numerical solution of smooth and weakly-singular Volterra integral equations. In this paper we extend these methods, thro...
Samuel A. Isaacson, Robert M. Kirby
92
Voted
CSC
2006
15 years 2 months ago
Irregular Solutions of an Ill-Posed Problem
Abstract: Tikhonov regularization is a popular and effective method for the approximate solution of illposed problems, including Fredholm equations of the first kind. The Tikhonov ...
Peter Linz, Richard Wang
67
Voted
SIAMJO
2008
57views more  SIAMJO 2008»
15 years 19 days ago
Universal Confidence Sets for Solutions of Optimization Problems
We consider random approximations to deterministic optimization problems. The objective function and the constraint set can be approximated simultaneously. Relying on concentratio...
Silvia Vogel
124
Voted
EWC
2010
178views more  EWC 2010»
14 years 10 months ago
Design of tensegrity structures using parametric analysis and stochastic search
Tensegrity structures are lightweight structures composed of cables in tension and struts in compression. Since tensegrity systems exhibit geometrically nonlinear behavior, findin...
Landolf Rhode-Barbarigos, Himanshu Jain, Prakash K...