Sciweavers

2766 search results - page 373 / 554
» Algorithms for trigonometric polynomials
Sort
View
CORR
2006
Springer
91views Education» more  CORR 2006»
15 years 4 months ago
The Complexity of Mean Flow Time Scheduling Problems with Release Times
We study the problem of preemptive scheduling n jobs with given release times on m identical parallel machines. The objective is to minimize the average flow time. We show that wh...
Philippe Baptiste, Peter Brucker, Marek Chrobak, C...
DSP
2006
15 years 4 months ago
Multicomponent chirp signals analysis using product cubic phase function
This paper presents an algorithm for estimating the parameters of multicomponent chirp signals. The estimator is based on the cubic phase function (CPF), which is efficient to est...
Pu Wang, Jianyu Yang
ENTCS
2006
113views more  ENTCS 2006»
15 years 4 months ago
A Large-Scale Experiment in Executing Extracted Programs
It is a well-known fact that algorithms are often hidden inside mathematical proofs. If these proofs are formalized inside a proof assistant, then a mechanism called extraction ca...
Luís Cruz-Filipe, Pierre Letouzey
IJCV
2008
88views more  IJCV 2008»
15 years 4 months ago
On the Local Behavior of Spaces of Natural Images
In this study we concentrate on qualitative topological analysis of the local behavior of the space of natural images. To this end, we use a space of 3 by 3 high-contrast patches ...
Gunnar Carlsson, Tigran Ishkhanov, Vin de Silva, A...
COMBINATORICS
2007
85views more  COMBINATORICS 2007»
15 years 4 months ago
Maximum Cardinality 1-Restricted Simple 2-Matchings
A simple 2-matching in a graph is a subgraph all of whose nodes have degree 1 or 2. A simple 2-matching is called k-restricted if every connected component has > k edges. We co...
David Hartvigsen