125 search results - page 5 / 25 » Finding Skew Partitions Efficiently |
SIGMOD
2007
ACM
14 years 7 months ago
2007
ACM
Data availability, collection and storage have increased dramatically in recent years, raising new technological and algorithmic challenges for database design and data management...
AUTOMATICA
2010
13 years 5 months ago
2010
When a phenomenon is described by a parametric model and multiple datasets are available, a key problem in statistics is to discover which datasets are characterized by the same p...
ICDE
2006
IEEE
14 years 9 months ago
2006
IEEE
This paper proposes and solves the Time-Interval All Fastest Path (allFP) query. Given a user-defined leaving or arrival time interval I, a source node s and an end node e, allFP ...
CVPR
2009
IEEE
15 years 2 months ago
2009
IEEE
In this work we propose a convex relaxation approach
for computing minimal partitions. Our approach is based
on rewriting the minimal partition problem (also known as
Potts mode...
ECRTS
2004
IEEE
13 years 11 months ago
2004
IEEE
We present an approach to partitioning and mapping for multicluster embedded systems consisting of time-triggered and eventtriggered clusters, interconnected via gateways. We have...