Sciweavers

727 search results - page 115 / 146
» Private approximation of search problems
Sort
View
PROCEDIA
2010
75views more  PROCEDIA 2010»
13 years 8 months ago
Two derivative-free optimization algorithms for mesh quality improvement
High-quality meshes are essential in the solution of partial differential equations (PDEs), which arise in numerous science and engineering applications, as the mesh quality aff...
Jeonghyung Park, Suzanne M. Shontz
TSP
2010
13 years 4 months ago
A low complexity blind estimator of narrowband polynomial phase signals
Consider the problem of estimating the parameters of multiple polynomial phase signals observed by a sensor array. In practice, it is difficult to maintain a precisely calibrated a...
Alon Amar, Amir Leshem, Alle-Jan van der Veen
KDD
2012
ACM
187views Data Mining» more  KDD 2012»
12 years 9 days ago
Online learning to diversify from implicit feedback
In order to minimize redundancy and optimize coverage of multiple user interests, search engines and recommender systems aim to diversify their set of results. To date, these dive...
Karthik Raman, Pannaga Shivaswamy, Thorsten Joachi...
JMLR
2006
124views more  JMLR 2006»
13 years 9 months ago
Policy Gradient in Continuous Time
Policy search is a method for approximately solving an optimal control problem by performing a parametric optimization search in a given class of parameterized policies. In order ...
Rémi Munos
CGO
2011
IEEE
13 years 1 months ago
Language and compiler support for auto-tuning variable-accuracy algorithms
—Approximating ideal program outputs is a common technique for solving computationally difficult problems, for adhering to processing or timing constraints, and for performance ...
Jason Ansel, Yee Lok Wong, Cy P. Chan, Marek Olsze...