Sciweavers

1999 search results - page 51 / 400
» Finding Reductions Automatically
Sort
View
FAC
2008
100views more  FAC 2008»
14 years 9 months ago
Slicing communicating automata specifications: polynomial algorithms for model reduction
Abstract. Slicing is a program analysis technique that was originally introduced to improve program debugging and understanding. The purpose of a slicing algorithm is to remove the...
Sébastien Labbé, Jean-Pierre Gallois
SIGCSE
2004
ACM
140views Education» more  SIGCSE 2004»
15 years 3 months ago
CFX: finding just the right examples for CS1
Finding just the right example to answer a question can be difficult for CS1 students and teachers. For this to work well there must be an intuitive interface coupled to an approp...
Dale Reed, Sam John, Ryan Aviles, Feihong Hsu
CCGRID
2006
IEEE
15 years 3 months ago
Statistical Data Reduction for Efficient Application Performance Monitoring
There is a growing need for systems that can monitor and analyze application performance data automatically in order to deliver reliable and sustained performance to applications....
Lingyun Yang, Jennifer M. Schopf, Catalin Dumitres...
BMVC
2010
14 years 7 months ago
Evaluation of dimensionality reduction methods for image auto-annotation
Image auto-annotation is a challenging task in computer vision. The goal of this task is to predict multiple words for generic images automatically. Recent state-of-theart methods...
Hideki Nakayama, Tatsuya Harada, Yasuo Kuniyoshi
INLG
2010
Springer
14 years 7 months ago
Finding Common Ground: Towards a Surface Realisation Shared Task
In many areas of NLP reuse of utility tools such as parsers and POS taggers is now common, but this is still rare in NLG. The subfield of surface realisation has perhaps come clos...
Anja Belz, Mike White, Josef van Genabith, Deirdre...