188 search results - page 32 / 38 » Finding Best k Policies |
STOC
2009
ACM
14 years 10 months ago
2009
ACM
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 ...
IMC
2010
ACM
13 years 7 months ago
2010
ACM
3G cellular data networks have recently witnessed explosive growth. In this work, we focus on UMTS, one of the most popular 3G mobile communication technologies. Our work is the f...
PODC
1994
ACM
14 years 1 months ago
1994
ACM
The notion of belief has been useful in reasoning about authentication protocols. In this paper, we show how the notion of belief can be applied to reasoning about cache coherence...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
This research applies ideas from argumentation theory in the context of semantic wikis, aiming to provide support for structured-large scale argumentation between human agents. The...
CIKM
2006
Springer
13 years 11 months ago
2006
Springer
In this paper, we propose a fast, memory-efficient, and scalable clustering algorithm for analyzing transactional data. Our approach has three unique features. First, we use the c...