Sciweavers

62 search results - page 5 / 13
» Complexity measures of sign matrices
Sort
View
SODA
2008
ACM
144views Algorithms» more  SODA 2008»
14 years 10 months ago
Fast dimension reduction using Rademacher series on dual BCH codes
The Fast Johnson-Lindenstrauss Transform (FJLT) was recently discovered by Ailon and Chazelle as a novel technique for performing fast dimension reduction with small distortion fr...
Nir Ailon, Edo Liberty
HICSS
2002
IEEE
130views Biometrics» more  HICSS 2002»
15 years 2 months ago
Designing Complex Software Implementation Programs
The central question of this paper is: How can design of Program Management contribute to the success of complex software implementations? Incomplete goal specifications, lack of ...
Pieter M. A. Ribbers, Klaus-Clemens Schoo
MA
2010
Springer
140views Communications» more  MA 2010»
14 years 7 months ago
The Dirichlet Markov Ensemble
We equip the polytope of n × n Markov matrices with the normalized trace of the Lebesgue measure of Rn2 . This probability space provides random Markov matrices, with i.i.d. rows...
Djalil Chafaï
ICASSP
2008
IEEE
15 years 3 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...
CICLING
2012
Springer
13 years 5 months ago
Core-Periphery Organization of Graphemes in Written Sequences: Decreasing Positional Rigidity with Increasing Core Order
The positional rigidity of graphemes (as well as words considered as single units) in written sequences has been analyzed in this paper using complex network methodology. In partic...
Md. Izhar Ashraf, Sitabhra Sinha