Sciweavers

104 search results - page 21 / 21
» Efficient Algorithms for k Maximum Sums
Sort
View
DAC
2005
ACM
14 years 8 months ago
Dynamic slack reclamation with procrastination scheduling in real-time embedded systems
Leakage energy consumption is an increasing concern in current and future CMOS technologygenerations. Procrastination scheduling, where task execution can be delayed to maximize t...
Ravindra Jejurikar, Rajesh K. Gupta
ICDE
2010
IEEE
371views Database» more  ICDE 2010»
14 years 7 months ago
TASM: Top-k Approximate Subtree Matching
Abstract-- We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large docum...
Nikolaus Augsten, Denilson Barbosa, Michael H. B&o...
VLDB
2007
ACM
122views Database» more  VLDB 2007»
14 years 7 months ago
MIST: Distributed Indexing and Querying in Sensor Networks using Statistical Models
The modeling of high level semantic events from low level sensor signals is important in order to understand distributed phenomena. For such content-modeling purposes, transformat...
Arnab Bhattacharya, Anand Meka, Ambuj K. Singh
JSAC
2008
140views more  JSAC 2008»
13 years 7 months ago
Optimality and Complexity of Pure Nash Equilibria in the Coverage Game
In this paper, we investigate the coverage problem in wireless sensor networks using a game theory method. We assume that nodes are randomly scattered in a sensor field and the goa...
Xin Ai, Vikram Srinivasan, Chen-Khong Tham