Sciweavers

58 search results - page 5 / 12
» Approximation accuracy, gradient methods, and error bound fo...
Sort
View
TIT
2008
109views more  TIT 2008»
13 years 7 months ago
Statistical Analysis of Bayes Optimal Subset Ranking
Abstract--The ranking problem has become increasingly important in modern applications of statistical methods in automated decision making systems. In particular, we consider a for...
David Cossock, Tong Zhang
MOC
2011
13 years 2 months ago
Analysis of HDG methods for Stokes flow
Abstract. In this paper, we analyze a hybridizable discontinuous Galerkin method for numerically solving the Stokes equations. The method uses polynomials of degree k for all the c...
Bernardo Cockburn, Jayadeep Gopalakrishnan, Ngoc C...
AUTOMATICA
2008
139views more  AUTOMATICA 2008»
13 years 7 months ago
Structured low-rank approximation and its applications
Fitting data by a bounded complexity linear model is equivalent to low-rank approximation of a matrix constructed from the data. The data matrix being Hankel structured is equival...
Ivan Markovsky
ICASSP
2011
IEEE
12 years 11 months ago
An approximate Minimum MOSPA estimator
Optimizing over a variant of the Mean Optimal Subpattern Assignment (MOSPA) metric is equivalent to optimizing over the track accuracy statistic often used in target tracking benc...
David Frederic Crouse, Peter Willett, Marco Guerri...
ICDE
2005
IEEE
135views Database» more  ICDE 2005»
14 years 9 months ago
Finding (Recently) Frequent Items in Distributed Data Streams
We consider the problem of maintaining frequency counts for items occurring frequently in the union of multiple distributed data streams. Na?ive methods of combining approximate f...
Amit Manjhi, Vladislav Shkapenyuk, Kedar Dhamdhere...