Sciweavers

2254 search results - page 309 / 451
» Computing the minimal covering set
Sort
View
INFOCOM
2009
IEEE
16 years 25 days ago
Polynomial Time Approximations for Multi-Path Routing with Bandwidth and Delay Constraints
— In this paper, we study the problem of multi-path routing with bandwidth and delay constraints, which arises in applications for video delivery over bandwidth-limited networks....
Satyajayant Misra, Guoliang Xue, Dejun Yang
CIKM
2009
Springer
16 years 22 days ago
Packing the most onto your cloud
Parallel dataflow programming frameworks such as Map-Reduce are increasingly being used for large scale data analysis on computing clouds. It is therefore becoming important to a...
Ashraf Aboulnaga, Ziyu Wang, Zi Ye Zhang
LION
2009
Springer
160views Optimization» more  LION 2009»
16 years 21 days ago
Corridor Selection and Fine Tuning for the Corridor Method
In this paper we present a novel hybrid algorithm, in which ideas from the genetic algorithm and the GRASP metaheuristic are cooperatively used and intertwined to dynamically adjus...
Marco Caserta, Stefan Voß
ICDM
2008
IEEE
120views Data Mining» more  ICDM 2008»
16 years 18 days ago
Anti-monotonic Overlap-Graph Support Measures
In graph mining, a frequency measure is anti-monotonic if the frequency of a pattern never exceeds the frequency of a subpattern. The efficiency and correctness of most graph pat...
Toon Calders, Jan Ramon, Dries Van Dyck
DATE
2007
IEEE
114views Hardware» more  DATE 2007»
16 years 15 days ago
Performance aware secure code partitioning
Many embedded applications exist where decisions are made using sensitive information. A critical issue in such applications is to ensure that data is accessed only by authorized ...
Sri Hari Krishna Narayanan, Mahmut T. Kandemir, Ri...