752 search results - page 97 / 151 » Faster approximation algorithms for the minimum latency prob... |
145
click to vote
ACL
1997
15 years 4 months ago
1997
Although adequate models of human language for syntactic analysis and semantic interpretation are of at least contextfree complexity, for applications such as speech processing in...
117
Voted
RECONFIG
2009
IEEE
15 years 10 months ago
2009
IEEE
BLASTn is a ubiquitous tool used for large scale DNA analysis. Detailed profiling tests reveal that the most computationally intensive sections of the BLASTn algorithm are the sc...
142
click to vote
JCO
2008
15 years 3 months ago
2008
The problem of partitioning a partially ordered set into a minimum number of chains is a well-known problem. In this paper we study a generalization of this problem, where we not ...
GLOBECOM
2006
IEEE
15 years 9 months ago
2006
IEEE
Abstract— In this paper, we propose a power optimal opportunistic scheduling scheme for a multiuser single hop Time Division Multiple Access (TDMA) system. We formulate the probl...
114
Voted
IPPS
2010
IEEE
15 years 1 months ago
2010
IEEE
We present collaborative peer-to-peer algorithms for the problem of approximating frequency counts for popular items distributed across the peers of a large-scale network. Our alg...