Sciweavers

3096 search results - page 417 / 620
» The Generalized FITC Approximation
Sort
View
JSCIC
2010
150views more  JSCIC 2010»
15 years 1 months ago
A Central Discontinuous Galerkin Method for Hamilton-Jacobi Equations
In this paper, a central discontinuous Galerkin method is proposed to solve for the viscosity solutions of Hamilton-Jacobi equations. Central discontinuous Galerkin methods were or...
Fengyan Li, Sergey Yakovlev
TCIAIG
2010
15 years 1 months ago
The Parametrized Probabilistic Finite-State Transducer Probe Game Player Fingerprint Model
Abstract--Fingerprinting operators generate functional signatures of game players and are useful for their automated analysis independent of representation or encoding. The theory ...
Jeffrey Tsang
TEC
2010
193views more  TEC 2010»
15 years 1 months ago
Chemical-Reaction-Inspired Metaheuristic for Optimization
-- We encounter optimization problems in our daily lives and in various research domains. Some of them are so hard that we can, at best, approximate the best solutions with (meta-)...
Albert Y. S. Lam, Victor O. K. Li
CORR
2011
Springer
202views Education» more  CORR 2011»
15 years 28 days ago
Noisy matrix decomposition via convex relaxation: Optimal rates in high dimensions
We analyze a class of estimators based on a convex relaxation for solving highdimensional matrix decomposition problems. The observations are the noisy realizations of the sum of ...
Alekh Agarwal, Sahand Negahban, Martin J. Wainwrig...
STOC
2007
ACM
83views Algorithms» more  STOC 2007»
16 years 6 months ago
Lattices that admit logarithmic worst-case to average-case connection factors
We demonstrate an average-case problem that is as hard as finding (n)-approximate shortest vectors in certain n-dimensional lattices in the worst case, where (n) = O( log n). The...
Chris Peikert, Alon Rosen