Sciweavers

IDA
2007
Springer
13 years 9 months ago
Anomaly detection in data represented as graphs
An important area of data mining is anomaly detection, particularly for fraud. However, little work has been done in terms of detecting anomalies in data that is represented as a g...
William Eberle, Lawrence B. Holder
NA
2006
84views more  NA 2006»
13 years 9 months ago
Fast Moreau envelope computation I: numerical algorithms
Abstract. The present article summarizes the state of the art algorithms to compute the discrete Moreau envelope, and presents a new linear-time algorithm, named NEP for NonExpansi...
Yves Lucet
PAMI
2008
162views more  PAMI 2008»
13 years 9 months ago
Bayes Optimality in Linear Discriminant Analysis
We present an algorithm which provides the one-dimensional subspace where the Bayes error is minimized for the C class problem with homoscedastic Gaussian distributions. Our main ...
Onur C. Hamsici, Aleix M. Martínez
MMS
2006
13 years 9 months ago
View-invariant motion trajectory-based activity classification and recognition
Motion trajectories provide rich spatio-temporal information about an object's activity. The trajectory information can be obtained using a tracking algorithm on data streams ...
Faisal I. Bashir, Ashfaq A. Khokhar, Dan Schonfeld
FMSD
2007
110views more  FMSD 2007»
13 years 9 months ago
Exploiting interleaving semantics in symbolic state-space generation
Symbolic techniques based on Binary Decision Diagrams (BDDs) are widely employed for reasoning about temporal properties of hardware circuits and synchronous controllers. However, ...
Gianfranco Ciardo, Gerald Lüttgen, Andrew S. ...
NECO
2008
129views more  NECO 2008»
13 years 9 months ago
Sparse Coding via Thresholding and Local Competition in Neural Circuits
While evidence indicates that neural systems may be employing sparse approximations to represent sensed stimuli, the mechanisms underlying this ability are not understood. We desc...
Christopher J. Rozell, Don H. Johnson, Richard G. ...
NA
2008
144views more  NA 2008»
13 years 9 months ago
Another hybrid conjugate gradient algorithm for unconstrained optimization
Another hybrid conjugate gradient algorithm is subject to analysis. The parameter k is computed as a convex combination of HS k (Hestenes-Stiefel) and DY k (Dai-Yuan) algorithms, i...
Neculai Andrei
MST
2008
157views more  MST 2008»
13 years 9 months ago
Optimal On-Line Algorithms to Minimize Makespan on Two Machines with Resource Augmentation
We study the problem of on-line scheduling on two uniformly related machines where the on-line algorithm has resources different from those of the off-line algorithm. We consider ...
Leah Epstein, Arik Ganot
EOR
2007
110views more  EOR 2007»
13 years 9 months ago
A hierarchical ant based clustering algorithm and its use in three real-world applications
In this paper is presented a new model for data clustering, which is inspired from the selfassembly behavior of real ants. Real ants can build complex structures by connecting the...
Hanene Azzag, Gilles Venturini, Antoine Oliver, Ch...
JUCS
2006
124views more  JUCS 2006»
13 years 9 months ago
Variations on Itai-Rodeh Leader Election for Anonymous Rings and their Analysis in PRISM
Abstract: We present two probabilistic leader election algorithms for anonymous unidirectional rings with FIFO channels, based on an algorithm from Itai and Rodeh [Itai and Rodeh 1...
Wan Fokkink, Jun Pang