298 search results - page 39 / 60 » Competitive Analysis of Flash-Memory Algorithms |
COLING
2010
14 years 4 months ago
2010
We conduct a series of Part-of-Speech (POS) Tagging experiments using Expectation Maximization (EM), Variational Bayes (VB) and Gibbs Sampling (GS) against the Chinese Penn Treeba...
STOC
2004
ACM
15 years 10 months ago
2004
ACM
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
SODA
1998
ACM
14 years 11 months ago
1998
ACM
Consider the following file caching problem: in response to a sequence of requests for files, where each file has a specified size and retrieval cost, maintain a cache of files of ...
110
click to vote
FSE
2011
Springer
14 years 1 months ago
2011
Springer
Abstract. Blue Midnight Wish (BMW) is one of the fastest SHA-3 candidates in the second round of the competition. In this paper we study the compression function of BMW and we obta...
SIGIR
2009
ACM
15 years 4 months ago
2009
ACM
This paper describes a simple clustering approach to person name disambiguation of retrieved documents. The methods are based on standard IR concepts and do not require any task-s...