Sciweavers

2638 search results - page 306 / 528
» Random Geometric Complexes
Sort
View
ICDM
2008
IEEE
146views Data Mining» more  ICDM 2008»
16 years 1 months ago
Isolation Forest
Most existing model-based approaches to anomaly detection construct a profile of normal instances, then identify instances that do not conform to the normal profile as anomalies...
Fei Tony Liu, Kai Ming Ting, Zhi-Hua Zhou
APPROX
2005
Springer
94views Algorithms» more  APPROX 2005»
16 years 2 days ago
Testing Periodicity
A string α ∈ Σn is called p-periodic, if for every i, j ∈ {1, . . . , n}, such that i ≡ j mod p, αi = αj, where αi is the i-th place of α. A string α ∈ Σn is said t...
Oded Lachish, Ilan Newman
VLDB
2005
ACM
129views Database» more  VLDB 2005»
16 years 15 hour ago
Sketching Streams Through the Net: Distributed Approximate Query Tracking
Emerging large-scale monitoring applications require continuous tracking of complex dataanalysis queries over collections of physicallydistributed streams. Effective solutions hav...
Graham Cormode, Minos N. Garofalakis
ECAI
2004
Springer
15 years 12 months ago
On-Line Search for Solving Markov Decision Processes via Heuristic Sampling
In the past, Markov Decision Processes (MDPs) have become a standard for solving problems of sequential decision under uncertainty. The usual request in this framework is the compu...
Laurent Péret, Frédérick Garc...
ICDCS
2010
IEEE
15 years 10 months ago
LT Network Codes
This paper proposes LTNC, a new recoding algorithm to build low complexity network codes. At the core of LTNC is a decentralized version of LT codes that allows the use of fast be...
Mary-Luc Champel, Kévin Huguenin, Anne-Mari...