Sciweavers

779 search results - page 62 / 156
» Algorithms for the Sample Mean of Graphs
Sort
View
141
Voted
ICDM
2005
IEEE
165views Data Mining» more  ICDM 2005»
15 years 10 months ago
Orthogonal Neighborhood Preserving Projections
— Orthogonal Neighborhood Preserving Projections (ONPP) is a linear dimensionality reduction technique which attempts to preserve both the intrinsic neighborhood geometry of the ...
Effrosini Kokiopoulou, Yousef Saad
JEC
2006
61views more  JEC 2006»
15 years 4 months ago
Time-constrained loop scheduling with minimal resources
Many applications commonly found in digital signal processing and image processing applications can be represented by data-flow graphs (DFGs). In our previous work, we proposed a ...
Timothy W. O'Neil, Edwin Hsing-Mean Sha
ICASSP
2011
IEEE
14 years 8 months ago
Reaching consensus in asynchronous WSNs: Algebraic approach
Many models of wireless sensor networks (WSNs) assume a perfect synchronization along the graph of such network as a simplifying assumption. In our contribution we base our invest...
Ondrej Sluciak, Markus Rupp
SYNTHESE
2008
84views more  SYNTHESE 2008»
15 years 4 months ago
How experimental algorithmics can benefit from Mayo's extensions to Neyman-Pearson theory of testing
Although theoretical results for several algorithms in many application domains were presented during the last decades, not all algorithms can be analyzed fully theoretically. Exp...
Thomas Bartz-Beielstein
CONIELECOMP
2005
IEEE
15 years 10 months ago
A Comparative Simulation Study of Wavelet Based Denoising Algorithms
In this paper we present a comparative simulation study of three denoising algorithms using wavelets. The denoising algorithms (i.e., universal threshold, minimax threshold and ri...
M. C. E. Rosas-Orea, M. Hernandez-Diaz, Vicente Al...