Sciweavers

113 search results - page 19 / 23
» Compile-Time Debugging of C Programs Working on Trees
Sort
View
SENSYS
2006
ACM
15 years 3 months ago
Scalable data aggregation for dynamic events in sensor networks
Computing and maintaining network structures for efficient data aggregation incurs high overhead for dynamic events where the set of nodes sensing an event changes with time. Mor...
Kai-Wei Fan, Sha Liu, Prasun Sinha
SAC
2005
ACM
15 years 3 months ago
Performance analysis framework for large software-intensive systems with a message passing paradigm
The launch of new features for mobile phones is increasing and the product life cycle symmetrically decreasing in duration as higher levels of sophistication are reached. Therefor...
Christian Del Rosso
ESA
2009
Springer
143views Algorithms» more  ESA 2009»
15 years 4 months ago
On Optimally Partitioning a Text to Improve Its Compression
In this paper we investigate the problem of partitioning an input string T in such a way that compressing individually its parts via a basecompressor C gets a compressed output th...
Paolo Ferragina, Igor Nitto, Rossano Venturini
ICSE
2008
IEEE-ACM
15 years 10 months ago
Testing pervasive software in the presence of context inconsistency resolution services
Pervasive computing software adapts its behavior according to the changing contexts. Nevertheless, contexts are often noisy. Context inconsistency resolution provides a cleaner pe...
Heng Lu, W. K. Chan, T. H. Tse
MICRO
2009
IEEE
168views Hardware» more  MICRO 2009»
15 years 4 months ago
Ordering decoupled metadata accesses in multiprocessors
Hardware support for dynamic analysis can minimize the performance overhead of useful applications such as security checks, debugging, and profiling. To eliminate implementation ...
Hari Kannan