Sciweavers

10899 search results - page 84 / 2180
» Wide Area Computation
Sort
View
NIPS
2000
15 years 5 months ago
The Use of MDL to Select among Computational Models of Cognition
How should we decide among competing explanations of a cognitive process given limited observations? The problem of model selection is at the heart of progress in cognitive scienc...
In Jae Myung, Mark A. Pitt, Shaobo Zhang, Vijay Ba...
SAC
2000
ACM
15 years 8 months ago
Assurance Protocols and Small Web Retailers
Many Web areas are in an early technological period of rapid evolution and intense competitive selection. Nowhere is this truer than with electronic commerce. While much is being ...
G. E. Lyon
CIKM
2000
Springer
15 years 8 months ago
Dimensionality Reduction and Similarity Computation by Inner Product Approximations
—As databases increasingly integrate different types of information such as multimedia, spatial, time-series, and scientific data, it becomes necessary to support efficient retri...
Ömer Egecioglu, Hakan Ferhatosmanoglu
IPPS
2010
IEEE
15 years 1 months ago
Fast Smith-Waterman hardware implementation
The Smith-Waterman (SW) algorithm is one of the widely used algorithms for sequence alignment in computational biology. With the growing size of the sequence database, there is alw...
Zubair Nawaz, Koen Bertels, Huseyin Ekin Sumbul
SIGGRAPH
1994
ACM
15 years 8 months ago
A fast shadow algorithm for area light sources using backprojection
The fast identification of shadow regions due to area light sources is necessary for realistic rendering and for discontinuity meshing for global illumination. A new shadow-determ...
George Drettakis, Eugene Fiume