Sciweavers

129 search results - page 14 / 26
» Clustering-based locally linear embedding
Sort
View
CODES
2007
IEEE
14 years 1 months ago
Locality optimization in wireless applications
There is a strong need now for compilers of embedded systems to find effective ways of optimizing series of loop-nests, wherein majority of the memory references occur in the fo...
Javed Absar, Min Li, Praveen Raghavan, Andy Lambre...
PAKDD
2005
ACM
168views Data Mining» more  PAKDD 2005»
14 years 14 days ago
Adaptive Nonlinear Auto-Associative Modeling Through Manifold Learning
We propose adaptive nonlinear auto-associative modeling (ANAM) based on Locally Linear Embedding algorithm (LLE) for learning intrinsic principal features of each concept separatel...
Junping Zhang, Stan Z. Li
CASES
2003
ACM
14 years 7 days ago
Exploiting bank locality in multi-bank memories
Bank locality can be defined as localizing the number of load/store accesses to a small set of memory banks at a given time. An optimizing compiler can modify a given input code t...
Guilin Chen, Mahmut T. Kandemir, Hendra Saputra, M...
OTM
2005
Springer
14 years 14 days ago
Web Image Semantic Clustering
This paper provides a novel Web image clustering methodology based on their associated texts. In our approach, the semantics of Web images are firstly represented into vectors of t...
Zhiguo Gong, Leong Hou U, Chan Wa Cheang
SIAMCOMP
2008
78views more  SIAMCOMP 2008»
13 years 7 months ago
I/O-Efficient Planar Separators
We present a new algorithm to compute a subset S of vertices of a planar graph G whose removal partitions G into O(N/h) subgraphs of size O(h) and with boundary size O( h) each. ...
Anil Maheshwari, Norbert Zeh