Sciweavers

2124 search results - page 323 / 425
» Aggregating time partitions
Sort
View
IFIPTCS
2010
15 years 2 months ago
Approximating the Non-contiguous Multiple Organization Packing Problem
We present in this paper a 5/2-approximation algorithm for scheduling rigid jobs on multi-organizations. For a given set of n jobs, the goal is to construct a schedule for N organi...
Marin Bougeret, Pierre-François Dutot, Klau...
ICDE
2012
IEEE
227views Database» more  ICDE 2012»
13 years 7 months ago
Temporal Analytics on Big Data for Web Advertising
—“Big Data” in map-reduce (M-R) clusters is often fundamentally temporal in nature, as are many analytics tasks over such data. For instance, display advertising uses Behavio...
Badrish Chandramouli, Jonathan Goldstein, Songyun ...
ICALP
2009
Springer
16 years 4 months ago
Counting Subgraphs via Homomorphisms
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
Omid Amini, Fedor V. Fomin, Saket Saurabh
KDD
2006
ACM
240views Data Mining» more  KDD 2006»
16 years 5 months ago
Adaptive event detection with time-varying poisson processes
Time-series of count data are generated in many different contexts, such as web access logging, freeway traffic monitoring, and security logs associated with buildings. Since this...
Alexander T. Ihler, Jon Hutchins, Padhraic Smyth
SAC
2010
ACM
15 years 11 months ago
On processing location based top-k queries in the wireless broadcasting system
In this paper, we explore the problem of processing a novel type of location based queries, named the location based top-k query, which involves both of spatial and non-spatial sp...
HaRim Jung, Byung Ku Cho, Yon Dohn Chung, Ling Liu