Sciweavers

10988 search results - page 2094 / 2198
» Algorithmic Folding Complexity
Sort
View
POPL
2010
ACM
16 years 1 months ago
Compress-and-conquer for optimal multicore computing
We propose a programming paradigm called compress-and-conquer (CC) that leads to optimal performance on multicore platforms. Given a multicore system of p cores and a problem of s...
Zhijing G. Mou, Hai Liu, Paul Hudak
EDBT
2010
ACM
177views Database» more  EDBT 2010»
16 years 1 months ago
Bridging the gap between intensional and extensional query evaluation in probabilistic databases
There are two broad approaches to query evaluation over probabilistic databases: (1) Intensional Methods proceed by manipulating expressions over symbolic events associated with u...
Abhay Jha, Dan Olteanu, Dan Suciu
LCTRTS
2010
Springer
16 years 1 months ago
Sampling-based program execution monitoring
For its high overall cost during product development, program debugging is an important aspect of system development. Debugging is a hard and complex activity, especially in time-...
Sebastian Fischmeister, Yanmeng Ba
TMA
2010
Springer
314views Management» more  TMA 2010»
16 years 1 months ago
On the Use of TCP Passive Measurements for Anomaly Detection: A Case Study from an Operational 3G Network
In this work we discuss the use of passive measurements of TCP performance indicators in support of network operation and troubleshooting, presenting a case-study from a real 3G ce...
Peter Romirer-Maierhofer, Angelo Coluccia, Tobias ...
PLDI
2009
ACM
16 years 1 months ago
Binary analysis for measurement and attribution of program performance
Modern programs frequently employ sophisticated modular designs. As a result, performance problems cannot be identified from costs attributed to routines in isolation; understand...
Nathan R. Tallent, John M. Mellor-Crummey, Michael...
« Prev « First page 2094 / 2198 Last » Next »