Sciweavers

425 search results - page 60 / 85
» Requirements, specifications, and minimal refinement
Sort
View
ICCNMC
2005
Springer
14 years 1 months ago
Sensor Network Configuration Under Physical Attacks
— In this paper, we address a sensor network lifetime problem that maintains a certain throughput in an environment where physical node destruction is possible. While lifetime is...
Xun Wang, Wenjun Gu, Kurt Schosek, Sriram Chellapp...
ANCS
2008
ACM
13 years 9 months ago
On design of bandwidth scheduling algorithms for multiple data transfers in dedicated networks
The significance of high-performance dedicated networks has been well recognized due to the rapidly increasing number of large-scale applications that require high-speed data tran...
Yunyue Lin, Qishi Wu
BMCBI
2006
202views more  BMCBI 2006»
13 years 7 months ago
Spectral embedding finds meaningful (relevant) structure in image and microarray data
Background: Accurate methods for extraction of meaningful patterns in high dimensional data have become increasingly important with the recent generation of data types containing ...
Brandon W. Higgs, Jennifer W. Weller, Jeffrey L. S...
SIAMCOMP
2008
167views more  SIAMCOMP 2008»
13 years 7 months ago
Approximation Algorithms for Data Placement Problems
We develop approximation algorithms for the problem of placing replicated data in arbitrary networks, where the nodes may both issue requests for data objects and have capacity fo...
Ivan D. Baev, Rajmohan Rajaraman, Chaitanya Swamy
CASES
2010
ACM
13 years 5 months ago
Balancing memory and performance through selective flushing of software code caches
Dynamic binary translators (DBTs) are becoming increasingly important because of their power and flexibility. However, the high memory demands of DBTs present an obstacle for all ...
Apala Guha, Kim M. Hazelwood, Mary Lou Soffa