Sciweavers

3270 search results - page 624 / 654
» Approximate String Processing
Sort
View
ICA
2004
Springer
14 years 1 months ago
Postnonlinear Overcomplete Blind Source Separation Using Sparse Sources
Abstract. We present an approach for blindly decomposing an observed random vector x into f(As) where f is a diagonal function i.e. f = f1 × . . . × fm with one-dimensional funct...
Fabian J. Theis, Shun-ichi Amari
WWW
2010
ACM
14 years 28 days ago
Data summaries for on-demand queries over linked data
Typical approaches for querying structured Web Data collect (crawl) and pre-process (index) large amounts of data in a central data repository before allowing for query answering....
Andreas Harth, Katja Hose, Marcel Karnstedt, Axel ...
PLDI
2003
ACM
14 years 26 days ago
Meta optimization: improving compiler heuristics with machine learning
Compiler writers have crafted many heuristics over the years to approximately solve NP-hard problems efficiently. Finding a heuristic that performs well on a broad range of applic...
Mark Stephenson, Saman P. Amarasinghe, Martin C. M...
SBCCI
2003
ACM
129views VLSI» more  SBCCI 2003»
14 years 26 days ago
Hyperspectral Images Clustering on Reconfigurable Hardware Using the K-Means Algorithm
Unsupervised clustering is a powerful technique for understanding multispectral and hyperspectral images, being k-means one of the most used iterative approaches. It is a simple th...
Abel Guilhermino S. Filho, Alejandro César ...
SIGUCCS
2003
ACM
14 years 26 days ago
Macintosh OS X: a smooth migration
The Ringling School of Art and Design is a fully accredited four year college of visual art and design with a student population of approximately 1000. The Ringling School has ach...
Scott E. Hanselman, Mahmoud Pegah