Sciweavers

903 search results - page 161 / 181
» On the reduction of a random basis
Sort
View
CASES
2006
ACM
15 years 4 months ago
Adaptive object code compression
Previous object code compression schemes have employed static and semiadaptive compression algorithms to reduce the size of instruction memory in embedded systems. The suggestion ...
John Gilbert, David M. Abrahamson
86
Voted
ISSTA
2006
ACM
15 years 4 months ago
Coverage and adequacy in software product line testing
Software product line modeling has received a great deal of attention for its potential in fostering reuse of software artifacts across development phases. Research on the testing...
Myra B. Cohen, Matthew B. Dwyer, Jiangfan Shi
104
Voted
SIGIR
2005
ACM
15 years 3 months ago
Orthogonal locality preserving indexing
We consider the problem of document indexing and representation. Recently, Locality Preserving Indexing (LPI) was proposed for learning a compact document subspace. Different from...
Deng Cai, Xiaofei He
119
Voted
MM
2004
ACM
167views Multimedia» more  MM 2004»
15 years 3 months ago
Learning an image manifold for retrieval
We consider the problem of learning a mapping function from low-level feature space to high-level semantic space. Under the assumption that the data lie on a submanifold embedded ...
Xiaofei He, Wei-Ying Ma, HongJiang Zhang
GECCO
2003
Springer
129views Optimization» more  GECCO 2003»
15 years 3 months ago
Inherent Fault Tolerance in Evolved Sorting Networks
This poster paper summarizes our research on fault tolerance arising as a by-product of the evolutionary computation process. Past research has shown evidence of robustness emergin...
Rob Shepherd, James A. Foster