Sciweavers

4911 search results - page 429 / 983
» Tree dependence analysis
Sort
View
IMCSIT
2010
15 years 4 months ago
Fast Construction of Broadcast Scheduling and Gossiping in Dynamic Ad Hoc Networks
This paper studies the minimum latency broadcast schedule (MLBS) problem in ad hoc networks represented by unit disk graphs. In our approach we use an algorithm, which does not nee...
Krzysztof Krzywdzinski
EMNLP
2009
15 years 4 months ago
Bilingually-Constrained (Monolingual) Shift-Reduce Parsing
Jointly parsing two languages has been shown to improve accuracies on either or both sides. However, its search space is much bigger than the monolingual case, forcing existing ap...
Liang Huang, Wenbin Jiang, Qun Liu
ICEIS
2009
IEEE
15 years 4 months ago
Pattern-Based Refactoring of Legacy Software Systems
Rearchitecturing large software systems becomes more and more complex after years of development and a growing size of the code base. Nonetheless, a constant adaptation of software...
Sascha Hunold, Björn Krellner, Thomas Rauber,...
ICMCS
2009
IEEE
159views Multimedia» more  ICMCS 2009»
15 years 4 months ago
Acoustic modeling using an extended phone set considering cross-lingual pronunciation variations
To deal with the issue of data unbalanced condition among a task of multilingual speech recognition and a phenomenon of pronunciation variations across languages, we propose an ap...
Dau-Cheng Lyu, Ren-Yuan Lyu, Ming-Tat Ko
GC
2011
Springer
15 years 1 months ago
Ramsey Numbers of Some Bipartite Graphs Versus Complete Graphs
The Ramsey number r(H, Kn) is the smallest positive integer N such that every graph of order N contains either a copy of H or an independent set of size n. The Tur´an number ex(m,...
Tao Jiang, Michael Salerno