Sciweavers

717 search results - page 99 / 144
» Efficient implementation of SVM for large class problems
Sort
View
COMPGEOM
2006
ACM
14 years 7 days ago
I/O-efficient batched union-find and its applications to terrain analysis
Despite extensive study over the last four decades and numerous applications, no I/O-efficient algorithm is known for the union-find problem. In this paper we present an I/O-effic...
Pankaj K. Agarwal, Lars Arge, Ke Yi
SDM
2008
SIAM
177views Data Mining» more  SDM 2008»
13 years 10 months ago
Practical Private Computation and Zero-Knowledge Tools for Privacy-Preserving Distributed Data Mining
In this paper we explore private computation built on vector addition and its applications in privacypreserving data mining. Vector addition is a surprisingly general tool for imp...
Yitao Duan, John F. Canny
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
DAC
2003
ACM
14 years 1 months ago
4G terminals: how are we going to design them?
Fourth-generation wireless communication systems (4G) will have totally different requirements than what front-end designers have been coping with up to now. Designs must be targe...
Jan Craninckx, Stéphane Donnay
EWCBR
2008
Springer
13 years 10 months ago
Real-Time Plan Adaptation for Case-Based Planning in Real-Time Strategy Games
Abstract. Case-based planning (CBP) is based on reusing past successful plans for solving new problems. CBP is particularly useful in environments where the large amount of time re...
Neha Sugandh, Santiago Ontañón, Ashw...