Results 31  40
of
1,434
SpeakerBased Segmentation For Audio Data Indexing
 Speech Communication
, 1999
"... In this paper, we address the problem of the speakerbased segmentation, which is the first necessary step for several indexing tasks. It consists in recognizing from their voice the sequence of people engaged in a conversation. In our context, we make no assumptions about prior knowledge of the spea ..."
Abstract

Cited by 93 (1 self)
 Add to MetaCart
points are detected and then, they are validated or discarded. Our algorithm is efficient to detect speaker changing points even close to one another and is thus suited for segmenting conversations containing segments of any length. 1. INTRODUCTION With the development of telecommunications
Algorithm Summary
"... • We will assume for now that the edge lengths are all positive. • The idea of Dijkstra’s Algorithm is to perform a graph search, updating the shortest known path to each encountered vertex as the search evolves. • Throughout the algorithm, we maintain a quantity d(v) for each node v, which represen ..."
Abstract
 Add to MetaCart
• We will assume for now that the edge lengths are all positive. • The idea of Dijkstra’s Algorithm is to perform a graph search, updating the shortest known path to each encountered vertex as the search evolves. • Throughout the algorithm, we maintain a quantity d(v) for each node v, which
Research and Application of BSS Algorithm on The Gearbox Fault Diagnosis Based on The MMI Criterion
"... This paper presented a kind of blind source separation (BSS) technology and applied it into the gearbox fault diagnosis through the blind mixing signal separation. The algorithm based on the natural gradient fixed steplength was used to calculate the statistical independent source signal estimate v ..."
Abstract
 Add to MetaCart
This paper presented a kind of blind source separation (BSS) technology and applied it into the gearbox fault diagnosis through the blind mixing signal separation. The algorithm based on the natural gradient fixed steplength was used to calculate the statistical independent source signal estimate
Exercise 1. The affine scaling algorithm.
, 2002
"... (a) Implement in MATLAB a function affscale.m which performs the affine scaling algorithm (as per p.400 in [1]). The prototype for the function is [xstar,ubflag,fconv,xconv] = affscale(A,b,c,x0,tol,beta), where the inputs A, b, and c are the usual (standard form) LP parameters, x0 is an initial fea ..."
Abstract
 Add to MetaCart
feasible solution, tol is the optimality tolerance, and beta is the steplength scale factor. The outputs are an optimal solution (if found) xstar, as well as the flag ubflag, which is 1 if the problem is detected to be unbounded and 0 otherwise. The last outputs are fconv, which is a vector storing
Algorithms for Learning by Distances
 Information and Computation
, 2001
"... We consider the information complexity of learning in metric spaces. We discuss two models of such learning processes. The first one is the Learning By Distances (LBD) model of BenDavid et al [BIK]. In this model a concept is a point in a metric space, at each step of the learning process the st ..."
Abstract

Cited by 17 (0 self)
 Add to MetaCart
We consider the information complexity of learning in metric spaces. We discuss two models of such learning processes. The first one is the Learning By Distances (LBD) model of BenDavid et al [BIK]. In this model a concept is a point in a metric space, at each step of the learning process
Impact of Algorithms on Green Computing
"... In computer science, the analysis of algorithms is the determination of the number of resources (such as time and storage) necessary to execute them. Most algorithms are designed to work with inputs of arbitrary length. Usually the efficiency or running time of an algorithm is stated as a function r ..."
Abstract
 Add to MetaCart
relating the input length to the number of steps (time complexity) or storage locations (space complexity). As the efficiency of algorithm increases number of steps involved in computation and storage requirement will reduce both of these will result in saving of electrical power and hence will contribute
Optimal Communication Algorithms On Star Graphs Using Spanning Tree Constructions
 Journal of Parallel and Distributed Computing
, 1993
"... In this paper we consider three fundamental communicationproblems on the star interconnection network: the problem of simultaneous broadcasting of the same message from every node to all other nodes, or multinode broadcasting, the problem of a single node sending distinct messages to each one of th ..."
Abstract

Cited by 28 (4 self)
 Add to MetaCart
and simultaneously it can receive a message of fixed length from one of its neighbors (not necessarily the same one) at each time step, or single link availability (SLA), and the assumption that each node can exchange messages of fixed length with all of its neighbors at each time step, or multiple link availability
Genetic Algorithms for Vertex Splitting in DAGs
, 1993
"... Directed Acyclic Graphs are often used to model circuits and networks. The path length in such Directed Acyclic Graphs represents circuit or network delays. In the vertex splitting problem, the objective is to determine a minimum number of vertices from the graph to split such that the resulting gra ..."
Abstract
 Add to MetaCart
graph has no path of length greater than a given d. The problem has been proven to be NPhard. A Genetic Algorithm is used to solve the DAG Vertex Splitting Problem. This approach uses a variable string length to represent the vertices that split the graph and a dynamic population size. The focus
A Spectral Conjugate Gradient Method for Unconstrained Optimization
, 1999
"... A family of scaled conjugategradient algorithms for largescale unconstrained minimization is dened. The Perry, the PolakRibiere and the FletcherReeves formulae are compared using a spectral scaling derived from Raydan's spectral gradient optimization method. The best combination of form ..."
Abstract

Cited by 26 (2 self)
 Add to MetaCart
of formula, scaling and initial choice of steplength is compared against well known algorithms using a classical set of problems. An additional comparison involving an illconditioned estimation problem in Optics is presented. Keywords. Unconstrained minimization, spectral gradient method, conjugate
Reversible integer DCT algorithms
"... Integer DCTs have important applications in lossless coding. An integer DCT of radix2 length n is a nonlinear, leftinvertible mapping which acts on Z^n and approximates the classical discrete cosine transform (DCT) of length n. In image compression, the DCT of type II (DCTII) is of special intere ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
is an orthogonal matrix of order 2. Hence one has to construct only integer transforms of length 2. The first approach uses expansion factors and roundingoff for the construction of integer transforms of length 2. The second approach works with lifting steps and roundingoff. This allows the construction of new
Results 31  40
of
1,434