Sciweavers

7 search results - page 1 / 2
» Co-Clustering under the Maximum Norm
Sort
View
EDBT
2009
ACM
119views Database» more  EDBT 2009»
13 years 7 months ago
Unrestricted wavelet synopses under maximum error bound
Constructing Haar wavelet synopses under a given approximation error has many real world applications. In this paper, we take a novel approach towards constructing unrestricted Ha...
Chaoyi Pang, Qing Zhang, David P. Hansen, Anthony ...
MP
2006
84views more  MP 2006»
13 years 4 months ago
On the behavior of the homogeneous self-dual model for conic convex optimization
Abstract. There is a natural norm associated with a starting point of the homogeneous selfdual (HSD) embedding model for conic convex optimization. In this norm two measures of the...
Robert M. Freund
CN
2007
141views more  CN 2007»
13 years 4 months ago
Identifying lossy links in wired/wireless networks by exploiting sparse characteristics
In this paper, we consider the problem of estimating link loss rates based on end-to-end path loss rates in order to identify lossy links on the network. We first derive a maximu...
Hyuk Lim, Jennifer C. Hou
CORR
2011
Springer
190views Education» more  CORR 2011»
12 years 8 months ago
Doubly Robust Smoothing of Dynamical Processes via Outlier Sparsity Constraints
Abstract—Coping with outliers contaminating dynamical processes is of major importance in various applications because mismatches from nominal models are not uncommon in practice...
Shahrokh Farahmand, Georgios B. Giannakis, Daniele...
KDD
2010
ACM
274views Data Mining» more  KDD 2010»
13 years 8 months ago
Grafting-light: fast, incremental feature selection and structure learning of Markov random fields
Feature selection is an important task in order to achieve better generalizability in high dimensional learning, and structure learning of Markov random fields (MRFs) can automat...
Jun Zhu, Ni Lao, Eric P. Xing