9888 search results - page 1870 / 1978 » compute 2009 |
111
click to vote
ALENEX
2009
14 years 10 months ago
2009
We consider the problem of finding a ranking of a set of elements that is "closest to" a given set of input rankings of the elements; more precisely, we want to find a p...
180
Voted
PODS
2009
ACM
16 years 1 months ago
2009
ACM
The paper investigates the question of whether a partially closed database has complete information to answer a query. In practice an enterprise often maintains master data Dm, a ...
ICC
2009
IEEE
15 years 7 months ago
2009
IEEE
—In host-based intrusion detection systems (HIDS), anomaly detection involves monitoring for significant deviations from normal system behavior. Hidden Markov Models (HMMs) have...
101
click to vote
INFOCOM
2009
IEEE
15 years 7 months ago
2009
IEEE
Abstract—Detecting the occurrence and location of performance anomalies (e.g., high jitter or loss events) is critical to ensuring the effective operation of network infrastructu...
APPROX
2009
Springer
15 years 7 months ago
2009
Springer
The Nearest Codeword Problem (NCP) is a basic algorithmic question in the theory of error-correcting codes. Given a point v ∈ Fn 2 and a linear space L ⊆ Fn 2 of dimension k NC...