2124 search results - page 337 / 425 » Aggregating time partitions |
MSWIM
2006
ACM
15 years 5 months ago
2006
ACM
We present an efficient algorithm to compute the coverage map of a given set of transmitters under interference constraints. That is, we compute the set of points that lie within ...
107
click to vote
PEWASUN
2006
ACM
15 years 5 months ago
2006
ACM
: Disruption Tolerant Networks (DTNs) are emerging solutions to networks that experience frequent network partitions and large end-to-end delays. Several schemes have been proposed...
SAC
2006
ACM
15 years 5 months ago
2006
ACM
We consider the problem of partitioning, in a highly accurate and highly efficient way, a set of n documents lying in a metric space into k non-overlapping clusters. We augment th...
CCGRID
2005
IEEE
15 years 5 months ago
2005
IEEE
Dynamically partitioning of adaptive applications and migration of excess workload from overloaded processors to underloaded processors during execution are critical techniques ne...
IEEEPACT
2005
IEEE
15 years 5 months ago
2005
IEEE
Scratchpad memory (SPM), a fast software-managed onchip SRAM, is now widely used in modern embedded processors. Compared to hardware-managed cache, it is more efficient in perfor...