Sciweavers

1439 search results - page 43 / 288
» Fast approximation of centrality
Sort
View
IPPS
2003
IEEE
14 years 4 months ago
A Fast Algorithm for Online Placement and Reorganization of Replicated Data
As storage systems scale to thousands of disks, data distribution and load balancing become increasingly important. We present an algorithm for allocating data objects to disks as...
R. J. Honicky, Ethan L. Miller
ACNS
2009
Springer
113views Cryptology» more  ACNS 2009»
14 years 3 months ago
Fast Packet Classification Using Condition Factorization
Abstract. Rule-based packet classification plays a central role in network intrusion detection systems such as Snort. To enhance performance, these rules are typically compiled int...
Alok Tongaonkar, R. Sekar, Sreenaath Vasudevan
ICMCS
2005
IEEE
132views Multimedia» more  ICMCS 2005»
14 years 4 months ago
Approximating the selectivity of multimedia range queries
This paper introduces a new approach of approximating the selectivity of multimedia range queries. Estimating the selectivity of a range query is a pre-requisite to optimize a mul...
Mario Döller, Harald Kosch
CIAC
2000
Springer
121views Algorithms» more  CIAC 2000»
14 years 2 months ago
An Efficient Algorithm for the Approximate Median Selection Problem
We present an efficient algorithm for the approximate median selection problem. The algorithm works in-place; it is fast and easy to implement. For a large array it returns, with ...
Sebastiano Battiato, Domenico Cantone, Dario Catal...
NIPS
2003
14 years 10 days ago
On the Concentration of Expectation and Approximate Inference in Layered Networks
We present an analysis of concentration-of-expectation phenomena in layered Bayesian networks that use generalized linear models as the local conditional probabilities. This frame...
XuanLong Nguyen, Michael I. Jordan