Sciweavers

76665 search results - page 15322 / 15333
» A proposed
Sort
View
WWW
2009
ACM
14 years 8 months ago
Smart Miner: a new framework for mining large scale web usage data
In this paper, we propose a novel framework called SmartMiner for web usage mining problem which uses link information for producing accurate user sessions and frequent navigation...
Murat Ali Bayir, Ismail Hakki Toroslu, Ahmet Cosar...
WWW
2005
ACM
14 years 8 months ago
CubeSVD: a novel approach to personalized Web search
As the competition of Web search market increases, there is a high demand for personalized Web search to conduct retrieval incorporating Web users' information needs. This pa...
Jian-Tao Sun, Hua-Jun Zeng, Huan Liu, Yuchang Lu, ...
STOC
2009
ACM
271views Algorithms» more  STOC 2009»
14 years 8 months ago
A fast and efficient algorithm for low-rank approximation of a matrix
The low-rank matrix approximation problem involves finding of a rank k version of a m ? n matrix AAA, labeled AAAk, such that AAAk is as "close" as possible to the best ...
Nam H. Nguyen, Thong T. Do, Trac D. Tran
PODC
2009
ACM
14 years 8 months ago
Simple and efficient asynchronous byzantine agreement with optimal resilience
Consider a completely asynchronous network consisting of n parties where every two parties are connected by a private channel. An adversary At with unbounded computing power activ...
Arpita Patra, Ashish Choudhary, C. Pandu Rangan
STOC
2006
ACM
130views Algorithms» more  STOC 2006»
14 years 7 months ago
Explicit capacity-achieving list-decodable codes
For every 0 < R < 1 and > 0, we present an explicit construction of error-correcting codes of rate R that can be list decoded in polynomial time up to a fraction (1 - R ...
Venkatesan Guruswami, Atri Rudra
« Prev « First page 15322 / 15333 Last » Next »