8825 search results - page 8 / 1765 » All for one or one for all |
UML
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. State machines, represented by statecharts or statechart diagrams, are an important formalism for behavioural modelling. According to the research literature, the most po...
SWAT
2004
Springer
14 years 28 days ago
2004
Springer
In this paper, we consider the problems of generating all maximal (bipartite) cliques in a given (bipartite) graph G = (V, E) with n vertices and m edges. We propose two algorithms...
JAIR
2008
13 years 7 months ago
2008
This article focuses on Word Sense Disambiguation (WSD), which is a Natural Language Processing task that is thought to be important for many Language Technology applications, suc...
STOC
2006
ACM
14 years 8 months ago
2006
ACM
A common thread in all the recent results concerning the testing of dense graphs is the use of Szemer?edi's regularity lemma. In this paper we show that in some sense this is...
LREC
2008
2008
All, and only, the Errors: more Complete and Consistent Spelling and OCR-Error Correction Evaluation
13 years 9 months ago
Some time in the future, some spelling error correction system will correct all the errors, and only the errors. We need evaluation metrics that will tell us when this has been ac...