10493 search results - page 296 / 2099 » Dynamic Word Problems |
167
click to vote
SIAMCOMP
2008
15 years 6 months ago
2008
We give a 7.18-approximation algorithm for the minimum latency problem that uses only O(n log n) calls to the prize-collecting Steiner tree (PCST) subroutine of Goemans and Willia...
204
click to vote
AMFG
2007
IEEE
15 years 10 months ago
2007
IEEE
Abstract. This paper addresses an aspect of sign language (SL) recognition that has largely been overlooked in previous work and yet is integral to signed communication. It is the ...
180
click to vote
ACL
2008
15 years 8 months ago
2008
In this paper we propose a domainindependent text segmentation method, which consists of three components. Latent Dirichlet allocation (LDA) is employed to compute words semantic ...
159
click to vote
PDCN
2004
15 years 8 months ago
2004
The paper describes an experimental system in which we linked together a number of computers over the Internet to form a multi-processor computer system. The arrangeme nt uses Jav...
175
click to vote
EELC
2006
15 years 10 months ago
2006
How does a shared lexicon arise in population of agents with differing lexicons, and how can this shared lexicon be maintained over multiple generations? In order to get some insig...