ICDAR
2009
IEEE
14 years 5 months ago
2009
IEEE
In this paper, we present a new approach to the temporal order restoration of the off-line handwriting. After the preprocessing steps of the word image, a suitable algorithm makes...
ICASSP
2009
IEEE
14 years 5 months ago
2009
IEEE
We are presenting an algorithm for scheduling users in a single-cell broadcast scenario. The presented algorithm aims to minimize the number of transmissions that are necessary to...
ICASSP
2009
IEEE
14 years 5 months ago
2009
IEEE
A computer vision based algorithm for wildfire detection is developed. The main detection algorithm is composed of four sub-algorithms detecting (i) slow moving objects, (ii) gra...
ICASSP
2009
IEEE
14 years 5 months ago
2009
IEEE
We present an algorithm to improve trajectory estimation in networks of non-overlapping cameras using audio measurements. The algorithm fuses audiovisual cues in each camera’s ...
ICASSP
2009
IEEE
14 years 5 months ago
2009
IEEE
Detection of filled pauses is a challenging research problem which has several practical applications. It can be used to evaluate the spoken fluency skills of the speaker, to im...
ICASSP
2009
IEEE
14 years 5 months ago
2009
IEEE
We propose a new optimization algorithm called Generalized Baum Welch (GBW) algorithm for discriminative training on hidden Markov model (HMM). GBW is based on Lagrange relaxation...
ICASSP
2009
IEEE
14 years 5 months ago
2009
IEEE
We propose a new active learning algorithm to address the problem of selecting a limited subset of utterances for transcribing from a large amount of unlabeled utterances so that ...
GLOBECOM
2009
IEEE
14 years 5 months ago
2009
IEEE
Abstract—Vehicular Ad-Hoc networks (VANETs) play a critical role in enabling important active safety applications such as collision warning and vehicle tracking. The most pressin...
FOCS
2009
IEEE
14 years 5 months ago
2009
IEEE
We prove the existence of an algorithm A for computing 2-d or 3-d convex hulls that is optimal for every point set in the following sense: for every set S of n points and for ever...
FOCS
2009
IEEE
14 years 5 months ago
2009
IEEE
— We show that for every fixed k, there is a linear time algorithm that decides whether or not a given graph has a vertex set X of order at most k such that G − X is planar (w...