Sciweavers

723 search results - page 93 / 145
» Computationally Efficient Transductive Machines
Sort
View
WWW
2009
ACM
14 years 9 months ago
Using graphics processors for high performance IR query processing
Web search engines are facing formidable performance challenges as they need to process thousands of queries per second over billions of documents. To deal with this heavy workloa...
Shuai Ding, Jinru He, Hao Yan, Torsten Suel
IPPS
2007
IEEE
14 years 3 months ago
Securing Grid Data Transfer Services with Active Network Portals
Widely available and utilized Grid servers are vulnerable to a variety of threats from Denial of Service (DoS) attacks, overloading caused by flash crowds, and compromised client ...
Onur Demir, Michael R. Head, Kanad Ghose, Madhusud...
DCC
1996
IEEE
14 years 1 months ago
On the Implementation of Minimum-Redundancy Prefix Codes
Abstract--Minimum redundancy coding (also known as Huffman coding) is one of the enduring techniques of data compression. Many efforts have been made to improve the efficiency of m...
Alistair Moffat, Andrew Turpin
CLUSTER
2006
IEEE
14 years 22 days ago
Lightweight I/O for Scientific Applications
Today's high-end massively parallel processing (MPP) machines have thousands to tens of thousands of processors, with next-generation systems planned to have in excess of one...
Ron Oldfield, Lee Ward, Rolf Riesen, Arthur B. Mac...
NIPS
2008
13 years 10 months ago
One sketch for all: Theory and Application of Conditional Random Sampling
Conditional Random Sampling (CRS) was originally proposed for efficiently computing pairwise (l2, l1) distances, in static, large-scale, and sparse data. This study modifies the o...
Ping Li, Kenneth Ward Church, Trevor Hastie