ICIP
2010
IEEE
13 years 7 months ago
2010
IEEE
In this paper we describe a new algorithm focused on obtaining stationary foreground regions, which is useful for applications like the detection of abandoned/stolen objects and p...
ICIP
2010
IEEE
13 years 7 months ago
2010
IEEE
The ability of Compressive Sensing (CS) to recover sparse signals from limited measurements has been recently exploited in computational imaging to acquire high-speed periodic and...
ICDM
2010
IEEE
13 years 7 months ago
2010
IEEE
Abstract--Data clustering is a highly used knowledge extraction technique and is applied in more and more application domains. Over the last years, a lot of algorithms have been pr...
ICASSP
2010
IEEE
13 years 7 months ago
2010
IEEE
We describe a fast and efficient online algorithm for phoneme sequence speech recognition. Our method is using a discriminative training to update the model parameters one utteran...
GLOBECOM
2010
IEEE
13 years 7 months ago
2010
IEEE
Machine learning algorithms have recently attracted much interest for effective link adaptation due to their flexibility and ability to capture more environmental effects implicitl...
GLOBECOM
2010
IEEE
13 years 7 months ago
2010
IEEE
We consider the channel selection problem in a cognitive radio network with heterogenous channel availabilities at different nodes. We formulate the maximum channel selection (MCS)...
FSTTCS
2010
Springer
13 years 7 months ago
2010
Springer
We describe a fixed parameter tractable (fpt) algorithm for Colored Hypergraph Isomorphism which has running time 2O(b) NO(1) , where the parameter b is the maximum size of the col...
FPL
2010
Springer
13 years 7 months ago
2010
Springer
One of the more popular placement algorithms for Field Programmable Gate Arrays (FPGAs) is called Simulated Annealing (SA). This algorithm tries to create a good quality placement ...
FOCS
2010
IEEE
13 years 7 months ago
2010
IEEE
We say an algorithm on n
FOCS
2010
IEEE
13 years 7 months ago
2010
IEEE
We present a new algorithm for learning a convex set in n-dimensional space given labeled examples drawn from any Gaussian distribution. The complexity of the algorithm is bounded ...