Sciweavers

Share
SDM
2012
SIAM
289views Data Mining» more  SDM 2012»
7 years 2 months ago
Mining Compressing Sequential Patterns
Compression based pattern mining has been successfully applied to many data mining tasks. We propose an approach based on the minimum description length principle to extract seque...
Hoang Thanh Lam, Fabian Moerchen, Dmitriy Fradkin,...
CVPR
2012
IEEE
7 years 2 months ago
Submodular dictionary learning for sparse coding
A greedy-based approach to learn a compact and discriminative dictionary for sparse representation is presented. We propose an objective function consisting of two components: ent...
Zhuolin Jiang, Guangxiao Zhang, Larry S. Davis
SODA
2012
ACM
173views Algorithms» more  SODA 2012»
7 years 2 months ago
Resource augmentation for weighted flow-time explained by dual fitting
We propose a general dual-fitting technique for analyzing online scheduling algorithms in the unrelated machines setting where the objective function involves weighted flow-time...
S. Anand 0002, Naveen Garg, Amit Kumar
TON
2012
7 years 2 months ago
Latency Equalization as a New Network Service Primitive
—Multiparty interactive network applications such as teleconferencing, network gaming, and online trading are gaining popularity. In addition to end-to-end latency bounds, these ...
Minlan Yu, Marina Thottan, Li (Erran) Li
AAAI
2011
7 years 12 months ago
On Expressing Value Externalities in Position Auctions
Externalities are recognized to exist in the sponsored search market, where two co-located ads compete for user attention. Existing work focuses on the effect of another ad on th...
Florin Constantin, Malvika Rao, Chien-Chung Huang,...
ICCV
2011
IEEE
7 years 12 months ago
Generalized Subgraph Preconditioners for Large-Scale Bundle Adjustment
We present a generalized subgraph preconditioning (GSP) technique to solve large-scale bundle adjustment problems efficiently. In contrast with previous work which uses either di...
Yong-Dian Jian, Doru C. Balcan, Frank Dellaert
SIAMMA
2011
97views more  SIAMMA 2011»
8 years 2 months ago
Convergence Rates for Greedy Algorithms in Reduced Basis Methods
The reduced basis method was introduced for the accurate online evaluation of solutions to a parameter dependent family of elliptic partial differential equations. ly, it can be ...
Peter Binev, Albert Cohen, Wolfgang Dahmen, Ronald...
ICDE
2011
IEEE
194views Database» more  ICDE 2011»
8 years 3 months ago
Representative skylines using threshold-based preference distributions
— The study of skylines and their variants has received considerable attention in recent years. Skylines are essentially sets of most interesting (undominated) tuples in a databa...
Atish Das Sarma, Ashwin Lall, Danupon Nanongkai, R...
ICIP
2009
IEEE
8 years 9 months ago
Randomness-in-Structured Ensembles for compressed sensing of images
Leading compressed sensing (CS) methods require m = O (k log(n)) compressive samples to perfectly reconstruct a k-sparse signal x of size n using random projection matrices (e.g., ...
Abdolreza A. Moghadam, Hayder Radha
IWPEC
2010
Springer
8 years 9 months ago
On the Grundy Number of a Graph
The Grundy number of a graph G, denoted by (G), is the largest k such that G has a greedy k-colouring, that is a colouring with k colours obtained by applying the greedy algorithm ...
Frédéric Havet, Leonardo Sampaio
books