Sciweavers

423 search results - page 78 / 85
» Using Test Suites in Evaluation of Machine Translation Syste...
Sort
View
COLT
1995
Springer
15 years 1 months ago
On the Learnability and Usage of Acyclic Probabilistic Finite Automata
We propose and analyze a distribution learning algorithm for a subclass of Acyclic Probabilistic Finite Automata (APFA). This subclass is characterized by a certain distinguishabi...
Dana Ron, Yoram Singer, Naftali Tishby
MHCI
2009
Springer
15 years 4 months ago
Automatic mobile menu customization based on user operation history
Mobile devices are becoming more and more difficult to use due to the sheer number of functions now supported. In this paper, we propose a menu customization system that ranks fun...
Yusuke Fukazawa, Mirai Hara, Masashi Onogi, Hideto...
ICFP
2006
ACM
15 years 9 months ago
Static typing for a faulty lambda calculus
A transient hardware fault occurs when an energetic particle strikes a transistor, causing it to change state. These faults do not cause permanent damage, but may result in incorr...
David Walker, Lester W. Mackey, Jay Ligatti, Georg...
IUI
2000
ACM
15 years 2 months ago
Learning to recommend from positive evidence
In recent years, many systems and approaches for recommending information, products or other objects have been developed. In these systems, often machine learning methods that nee...
Ingo Schwab, Wolfgang Pohl, Ivan Koychev
88
Voted
SAC
2011
ACM
14 years 14 days ago
Type harvesting: a practical approach to obtaining typing information in dynamic programming languages
Dynamically typed programming languages are powerful tools for rapid software development. However, there are scenarios that would benefit from actual type information being avai...
Michael Haupt, Michael Perscheid, Robert Hirschfel...