Sciweavers

239 search results - page 7 / 48
» Localized Upper and Lower Bounds for Some Estimation Problem...
Sort
View
ECCC
2010
122views more  ECCC 2010»
14 years 8 months ago
Query Complexity Lower Bounds for Reconstruction of Codes
We investigate the problem of local reconstruction, as defined by Saks and Seshadhri (2008), in the context of error correcting codes. The first problem we address is that of me...
Sourav Chakraborty, Eldar Fischer, Arie Matsliah
ICML
2008
IEEE
15 years 10 months ago
Estimating local optimums in EM algorithm over Gaussian mixture model
EM algorithm is a very popular iteration-based method to estimate the parameters of Gaussian Mixture Model from a large observation set. However, in most cases, EM algorithm is no...
Zhenjie Zhang, Bing Tian Dai, Anthony K. H. Tung
72
Voted
STOC
2009
ACM
133views Algorithms» more  STOC 2009»
15 years 10 months ago
Numerical linear algebra in the streaming model
We give near-optimal space bounds in the streaming model for linear algebra problems that include estimation of matrix products, linear regression, low-rank approximation, and app...
Kenneth L. Clarkson, David P. Woodruff
AIPS
2007
14 years 12 months ago
Bounding the Resource Availability of Activities with Linear Resource Impact
We introduce the Linear Resource Temporal Network (LRTN), which consists of activities that consume or produce a resource, subject to absolute and relative metric temporal constra...
Jeremy Frank, Paul H. Morris
IPPS
1999
IEEE
15 years 1 months ago
A Parallel Algorithm for Bound-Smoothing
Determining molecular structure from interatomic distances is an important and challenging problem. Given a molecule with n atoms, lower and upper bounds on interatomic distances ...
Kumar Rajan, Narsingh Deo