Sciweavers

2111 search results - page 116 / 423
» Understanding the Yarowsky Algorithm
Sort
View
ICIP
2007
IEEE
14 years 11 months ago
Motion Estimation using Tangent Distance
In this paper, we present a method based on tangent distance to estimate motion in image sequences. Tangent distance combines an intuitive understanding and effective modeling of ...
Jonathan Fabrizio, Séverine Dubuisson
CORR
2008
Springer
125views Education» more  CORR 2008»
14 years 10 months ago
Sensing Danger: Innate Immunology for Intrusion Detection
The immune system provides an ideal metaphor for anomaly detection in general and computer security in particular. Based on this idea, artificial immune systems have been used for...
Uwe Aickelin, Julie Greensmith
TIT
2010
171views Education» more  TIT 2010»
14 years 4 months ago
Analysis of orthogonal matching pursuit using the restricted isometry property
Orthogonal matching pursuit (OMP) is the canonical greedy algorithm for sparse approximation. In this paper we demonstrate that the restricted isometry property (RIP) can be used f...
Mark A. Davenport, Michael B. Wakin
FOGA
2011
14 years 1 months ago
Computational complexity analysis of simple genetic programming on two problems modeling isolated program semantics
Analyzing the computational complexity of evolutionary algorithms (EAs) for binary search spaces has significantly informed our understanding of EAs in general. With this paper, ...
Greg Durrett, Frank Neumann, Una-May O'Reilly
ICDCN
2011
Springer
14 years 1 months ago
Mining Frequent Subgraphs to Extract Communication Patterns in Data-Centres
In this paper, we propose to use graph-mining techniques to understand the communication pattern within a data-centre. We model the communication observed within a data-centre as a...
Maitreya Natu, Vaishali P. Sadaphal, Sangameshwar ...