743 search results - page 123 / 149 » Approximation Algorithms for Graph Homomorphism Problems |
ICASSP
2010
IEEE
13 years 8 months ago
2010
IEEE
We present a novel discriminative training algorithm for n-gram language models for use in large vocabulary continuous speech recognition. The algorithm uses large margin estimati...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
We consider an extension of the popular matching problem in this paper. The input to the popular matching problem is a bipartite graph G = (A ∪ B, E), where A is a set of people,...
DIALM
2008
ACM
13 years 9 months ago
2008
ACM
In opportunistic forwarding, a node randomly relays packets to one of its neighbors based on local information, without the knowledge of global topology. Each intermediate node co...
WABI
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. Protein structural alignment is an indispensable tool used for many different studies in bioinformatics. Most structural alignment algorithms assume that the structural ...
FSTTCS
2010
Springer
13 years 6 months ago
2010
Springer
We consider the following fundamental scheduling problem. The input consists of n jobs to be scheduled on a set of machines of bounded capacities. Each job is associated with a re...