Sciweavers

6562 search results - page 16 / 1313
» Noetherianity and Combination Problems
Sort
View
ACL
2009
13 years 7 months ago
Case markers and Morphology: Addressing the crux of the fluency problem in English-Hindi SMT
We report in this paper our work on accurately generating case markers and suffixes in English-to-Hindi SMT. Hindi is a relatively free word-order language, and makes use of a com...
Ananthakrishnan Ramanathan, Hansraj Choudhary, Avi...
ICCAD
2009
IEEE
96views Hardware» more  ICCAD 2009»
13 years 7 months ago
PSTA-based branch and bound approach to the silicon speedpath isolation problem
The lack of good "correlation" between pre-silicon simulated delays and measured delays on silicon (silicon data) has spurred efforts on so-called silicon debug. The ide...
Sari Onaissi, Khaled R. Heloue, Farid N. Najm
TC
2010
13 years 4 months ago
On the Problem of Evaluating the Performance of Multiprogrammed Workloads
Multithreaded architectures are becoming more and more popular. In order to evaluate their behavior, several methodologies and metrics have been proposed. A methodology defines whe...
Francisco J. Cazorla, Alex Pajuelo, Oliverio J. Sa...
NPL
2008
100views more  NPL 2008»
13 years 9 months ago
Comparing Combination Rules of Pairwise Neural Networks Classifiers
A decomposition approach to multiclass classification problems consists in decomposing a multiclass problem into a set of binary ones. Decomposition splits the complete multiclass ...
Olivier Lezoray, Hubert Cardot
NHM
2010
87views more  NHM 2010»
13 years 4 months ago
The coolest path problem
We introduce the coolest path problem, which is a mixture of two well-known problems from distinct mathematical fields. One of them is the shortest path problem from combinatorial ...
Martin Frank, Armin Fügenschuh, Michael Herty...