Sciweavers

199 search results - page 38 / 40
» Model Kit for Lightweight Data Compression Algorithms
Sort
View
SIGCOMM
2010
ACM
13 years 10 months ago
Topology-aware resource allocation for data-intensive workloads
This paper proposes an architecture for optimized resource allocation in Infrastructure-as-a-Service (IaaS)-based cloud systems. Current IaaS systems are usually unaware of the ho...
Gunho Lee, Niraj Tolia, Parthasarathy Ranganathan,...
RECOMB
2002
Springer
14 years 10 months ago
Monotony of surprise and large-scale quest for unusual words
The problem of characterizing and detecting recurrent sequence patterns such as substrings or motifs and related associations or rules is variously pursued in order to compress da...
Alberto Apostolico, Mary Ellen Bock, Stefano Lonar...
KDD
2006
ACM
139views Data Mining» more  KDD 2006»
14 years 10 months ago
Generating semantic annotations for frequent patterns with context analysis
As a fundamental data mining task, frequent pattern mining has widespread applications in many different domains. Research in frequent pattern mining has so far mostly focused on ...
Qiaozhu Mei, Dong Xin, Hong Cheng, Jiawei Han, Che...
WWW
2010
ACM
13 years 10 months ago
Mining advertiser-specific user behavior using adfactors
Consider an online ad campaign run by an advertiser. The ad serving companies that handle such campaigns record users' behavior that leads to impressions of campaign ads, as ...
Nikolay Archak, Vahab S. Mirrokni, S. Muthukrishna...
CPM
2004
Springer
144views Combinatorics» more  CPM 2004»
14 years 3 months ago
A Simple Optimal Representation for Balanced Parentheses
We consider succinct, or highly space-efficient, representations of a (static) string consisting of n pairs of balanced parentheses, that support natural operations such as findi...
Richard F. Geary, Naila Rahman, Rajeev Raman, Venk...