Sciweavers

939 search results - page 124 / 188
» Performance Analysis of Shared-Memory Parallel Applications ...
Sort
View
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
14 years 26 days ago
Near-Optimal Compression of Probabilistic Counting Sketches for Networking Applications
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
Björn Scheuermann, Martin Mauve
ICLP
2007
Springer
14 years 23 days ago
User-Definable Resource Bounds Analysis for Logic Programs
We present a static analysis that infers both upper and lower bounds on the usage that a logic program makes of a set of user-definable resources. The inferred bounds will in gener...
Jorge Navas, Edison Mera, Pedro López-Garc&...
SIGIR
2010
ACM
14 years 24 days ago
On statistical analysis and optimization of information retrieval effectiveness metrics
This paper presents a new way of thinking for IR metric optimization. It is argued that the optimal ranking problem should be factorized into two distinct yet interrelated stages:...
Jun Wang, Jianhan Zhu
INFOCOM
2006
IEEE
14 years 2 months ago
Reverse Hashing for High-Speed Network Monitoring: Algorithms, Evaluation, and Applications
— A key function for network traffic monitoring and analysis is the ability to perform aggregate queries over multiple data streams. Change detection is an important primitive w...
Robert T. Schweller, Zhichun Li, Yan Chen, Yan Gao...
BMCBI
2010
116views more  BMCBI 2010»
13 years 9 months ago
permGPU: Using graphics processing units in RNA microarray association studies
Background: Many analyses of microarray association studies involve permutation, bootstrap resampling and crossvalidation, that are ideally formulated as embarrassingly parallel c...
Ivo D. Shterev, Sin-Ho Jung, Stephen L. George, Ko...