Sciweavers

354 search results - page 49 / 71
» The Chromatic Number Of Graph Powers
Sort
View
ICRA
2000
IEEE
88views Robotics» more  ICRA 2000»
15 years 1 months ago
Incremental Optimization of Cyclic Timed Event Graphs
In this paper we deal with the problem of allocating a given number of tokens, so as to maximize the firing rate of a cyclic event graph with deterministic transition firing delay...
Alessandro Giua, Aldo Piccaluga, Carla Seatzu
SPAA
2010
ACM
14 years 9 months ago
Scheduling to minimize power consumption using submodular functions
We develop logarithmic approximation algorithms for extremely general formulations of multiprocessor multiinterval offline task scheduling to minimize power usage. Here each proce...
Erik D. Demaine, Morteza Zadimoghaddam
SIGMOD
2009
ACM
220views Database» more  SIGMOD 2009»
15 years 9 months ago
Keyword search in databases: the power of RDBMS
Keyword search in relational databases (RDBs) has been extensively studied recently. A keyword search (or a keyword query) in RDBs is specified by a set of keywords to explore the...
Lu Qin, Jeffrey Xu Yu, Lijun Chang
WADS
2009
Springer
291views Algorithms» more  WADS 2009»
15 years 4 months ago
On the Power of the Semi-Separated Pair Decomposition
Abstract. A Semi-Separated Pair Decomposition (SSPD), with parameter s > 1, of a set S ⊂ Rd is a set {(Ai, Bi)} of pairs of subsets of S such that for each i, there are balls ...
Mohammad Ali Abam, Paz Carmi, Mohammad Farshi, Mic...
87
Voted
ESA
2010
Springer
170views Algorithms» more  ESA 2010»
14 years 10 months ago
Streaming Graph Computations with a Helpful Advisor
Motivated by the trend to outsource work to commercial cloud computing services, we consider a variation of the streaming paradigm where a streaming algorithm can be assisted by a...
Graham Cormode, Michael Mitzenmacher, Justin Thale...