3270 search results - page 624 / 654 » Approximate String Processing |
156
click to vote
ICA
2004
Springer
15 years 11 months ago
2004
Springer
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...
172
click to vote
WWW
2010
ACM
15 years 11 months ago
2010
ACM
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....
171
click to vote
PLDI
2003
ACM
15 years 11 months ago
2003
ACM
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...
180
click to vote
SBCCI
2003
ACM
15 years 11 months ago
2003
ACM
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...
174
click to vote
SIGUCCS
2003
ACM
15 years 11 months ago
2003
ACM
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...