Sciweavers

2080 search results - page 152 / 416
» Measuring empirical computational complexity
Sort
View
TSP
2008
123views more  TSP 2008»
15 years 4 months ago
A Rough Programming Approach to Power-Balanced Instruction Scheduling for VLIW Digital Signal Processors
The focus of this paper is on VLIW instruction scheduling that minimizes the variation of power consumed by the processor during the execution of a target program. We use rough set...
Shu Xiao, Edmund Ming-Kit Lai
134
Voted
TASLP
2010
148views more  TASLP 2010»
14 years 11 months ago
Batch and Adaptive PARAFAC-Based Blind Separation of Convolutive Speech Mixtures
We present a frequency-domain technique based on PARAllel FACtor (PARAFAC) analysis that performs multichannel blind source separation (BSS) of convolutive speech mixtures. PARAFAC...
Dimitri Nion, Kleanthis N. Mokios, Nicholas D. Sid...
QI
2009
Springer
123views Physics» more  QI 2009»
15 years 11 months ago
Hilbert Space Models Commodity Exchanges
Abstract. It is argued that the vector space measures used to measure closeness of market prices to predictors for market prices are invalid because of the observed metric of commo...
Paul Cockshott
WG
2007
Springer
15 years 10 months ago
On Finding Graph Clusterings with Maximum Modularity
Modularity is a recently introduced quality measure for graph clusterings. It has immediately received considerable attention in several disciplines, and in particular in the compl...
Ulrik Brandes, Daniel Delling, Marco Gaertler, Rob...
CCCG
2008
15 years 6 months ago
Partial Matching of Planar Polygons Under Translation and Rotation
Curve matching is an important computational task for domains such as: reconstruction of archaeological fragments, forensics investigation, measuring melodic similarity, and model...
Eric McCreath