Sciweavers

257 search results - page 16 / 52
» Breaking Robert's Rules
Sort
View
WEA
2010
Springer
476views Algorithms» more  WEA 2010»
14 years 2 months ago
Fast FPT Algorithms for Computing Rooted Agreement Forests: Theory and Experiments
We improve on earlier FPT algorithms for computing a rooted maximum agreement forest (MAF) or a maximum acyclic agreement forest (MAAF) of a pair of phylogenetic trees. Their sizes...
Chris Whidden, Robert G. Beiko, Norbert Zeh
LICS
1987
IEEE
13 years 11 months ago
A Framework for Defining Logics
The Edinburgh Logical Framework (LF) provides a means to define (or present) logics. It is based on a general treatment of syntax, rules, and proofs by means of a typed -calculus ...
Robert Harper, Furio Honsell, Gordon D. Plotkin
TAMODIA
2007
13 years 9 months ago
Looking for Unexpected Consequences of Interface Design Decisions: The MeMo Workbench
This paper discusses and illustrates work in progress on the MEMO workbench for early model-based usability evaluation of interface designs. Characteristic features of the workbenc...
Anthony Jameson, Angela Mahr, Michael Kruppa, Andr...
ICPR
2008
IEEE
14 years 2 months ago
Ancient document analysis based on text line extraction
In order to preserve our cultural heritage and for automated document processing libraries and national archives have started digitizing historical documents. In the case of degra...
Florian Kleber, Robert Sablatnig, Melanie Gau, Hei...
LOPSTR
2001
Springer
14 years 12 days ago
On Deforesting Parameters of Accumulating Maps
Abstract. Deforestation is a well-known program transformation technique which eliminates intermediate data structures that are passed between functions. One of its weaknesses is t...
Kazuhiko Kakehi, Robert Glück, Yoshihiko Futa...