Sciweavers

2080 search results - page 74 / 416
» Measuring empirical computational complexity
Sort
View
ESA
2004
Springer
126views Algorithms» more  ESA 2004»
14 years 3 months ago
Path Decomposition Under a New Cost Measure with Applications to Optical Network Design
We introduce a problem directly inspired by its application to DWDM (dense wavelength division multiplexing) network design. We are given a set of demands to be carried over a netw...
Elliot Anshelevich, Lisa Zhang
ICASSP
2011
IEEE
13 years 1 months ago
Fast estimation of the state of the power grid using synchronized phasor measurements
—Both the communication limitation and the measurement properties based algorithm become the bottleneck of enhancing the traditional power system state estimation speed. The avai...
Tao Yang, Anjan Bose
ICASSP
2008
IEEE
14 years 4 months ago
A tempo-insensitive distance measure for cover song identification based on chroma features
We present a distance measure between audio files designed to identify cover songs, which are new renditions of previously recorded songs. For each song we compute the chromagram...
Jesper Højvang Jensen, Mads Græsb&osl...
CVPR
2000
IEEE
14 years 2 months ago
A Combined Feature-Texture Similarity Measure for Face Alignment under
We formulate face alignment as a model-based parameter estimation problem in this paper. First, we work within a framework that combines two separate subspace models to r epresent...
Lixin Fan, Kah Kay Sung
ICPR
2002
IEEE
14 years 11 months ago
Separating Color and Pattern Information for Color Texture Discrimination
The analysis of colored surface textures is a challenging research problem in computer vision. Current approaches to this task can be roughly divided into two categories: methods ...
Topi Mäenpää, Matti Pietikäine...