Sciweavers

815 search results - page 33 / 163
» Approximate Entropy Reducts
Sort
View
JVCIR
2007
96views more  JVCIR 2007»
14 years 11 months ago
Image decomposition combining staircase reduction and texture extraction
This paper proposes a natural and efficient way to achieve staircase reduction in texture extraction models of image processing. Moreover, we propose a precise framework for this ...
Tony F. Chan, Selim Esedoglu, Frederick E. Park
IDA
1998
Springer
14 years 11 months ago
Fast Dimensionality Reduction and Simple PCA
A fast and simple algorithm for approximately calculating the principal components (PCs) of a data set and so reducing its dimensionality is described. This Simple Principal Compo...
Matthew Partridge, Rafael A. Calvo
ICCAD
2002
IEEE
175views Hardware» more  ICCAD 2002»
15 years 8 months ago
Efficient model order reduction via multi-node moment matching
- The new concept of Multi-node Moment Matching (MMM) is introduced in this paper. The MMM technique simultaneously matches the moments at several nodes of a circuit using explicit...
Yehea I. Ismail
DIALM
2003
ACM
99views Algorithms» more  DIALM 2003»
15 years 5 months ago
Spatio-temporal data reduction with deterministic error bounds
A common way of storing spatio-temporal information about mobile devices is in the form of a 3D (2D geography + time) trajectory. We argue that when cellular phones and Personal D...
Hu Cao, Ouri Wolfson, Goce Trajcevski
SODA
2012
ACM
203views Algorithms» more  SODA 2012»
13 years 2 months ago
Black-box reductions for cost-sharing mechanism design
We consider the design of strategyproof cost-sharing mechanisms. We give two simple, but extremely versatile, black-box reductions, that in combination reduce the cost-sharing mec...
Konstantinos Georgiou, Chaitanya Swamy