Sciweavers

1091 search results - page 17 / 219
» Approximation Algorithms for Data Placement Problems
Sort
View
COCOON
2005
Springer
14 years 1 months ago
Algorithmic and Complexity Issues of Three Clustering Methods in Microarray Data Analysis
The complexity, approximation and algorithmic issues of several clustering problems are studied. These non-traditional clustering problems arise from recent studies in microarray ...
Jinsong Tan, Kok Seng Chua, Louxin Zhang
ADHOCNOW
2005
Springer
14 years 1 months ago
Cache Placement in Sensor Networks Under Update Cost Constraint
— In this paper, we address an optimization problem that arises in context of cache placement in sensor networks. In particular, we consider the cache placement problem where the...
Bin Tang, Samir R. Das, Himanshu Gupta
JDA
2007
135views more  JDA 2007»
13 years 7 months ago
Cache placement in sensor networks under an update cost constraint
In this paper, we address an optimization problem that arises in the context of cache placement in sensor networks. In particular, we consider the cache placement problem where th...
Bin Tang, Himanshu Gupta
VLSI
2010
Springer
13 years 6 months ago
Fine-grained post placement voltage assignment considering level shifter overhead
—Multi-Vdd techniques enable application of lower supply voltage levels on cells with timing slacks. New voltage assignment, placement and voltage island partitioning methods are...
Zohreh Karimi, Majid Sarrafzadeh
INFOCOM
2012
IEEE
11 years 10 months ago
On the construction of data aggregation tree with minimum energy cost in wireless sensor networks: NP-completeness and approxima
—In many applications, it is a basic operation for the sink to periodically collect reports from all sensors. Since the data gathering process usually proceeds for many rounds, i...
Tung-Wei Kuo, Ming-Jer Tsai