89 search results - page 17 / 18 » Scaled Dimension and Nonuniform Complexity |
233
Voted
ICA
2012
Springer
13 years 5 months ago
2012
Springer
A novel tensor decomposition called pattern or P-decomposition is proposed to make it possible to identify replicating structures in complex data, such as textures and patterns in ...
CVPR
2010
IEEE
15 years 5 months ago
2010
IEEE
We introduce a parametric version (pDRUR) of the recently proposed Dimensionality Reduction by Unsupervised Regression algorithm. pDRUR alternately minimizes reconstruction error ...
SIGSOFT
2003
ACM
15 years 2 months ago
2003
ACM
1 Step-wise refinement (SWR) asserts that complex programs can be derived from simple programs by progressively adding features. The length of a program specification is the number...
109
Voted
ICPP
2000
IEEE
15 years 1 months ago
2000
IEEE
Clustering is a data mining problem which finds dense regions in a sparse multi-dimensional data set. The attribute values and ranges of these regions characterize the clusters. ...
IJMMS
2008
14 years 9 months ago
2008
Maps are currently the most common application domain for ZUIs. Standard techniques for controlling such interfaces on pen-operated devices usually rely on sequential interaction,...