Sciweavers

963 search results - page 121 / 193
» Escape Analysis on Lists
Sort
View
ITA
2007
153views Communications» more  ITA 2007»
15 years 14 days ago
Deciding inclusion of set constants over infinite non-strict data structures
Abstract. Various static analyses of functional programming languages that permit infinite data structures make use of set constants like Top, Inf, and Bot, denoting all terms, al...
Manfred Schmidt-Schauß, David Sabel, Marko S...
110
Voted
JAPLL
2007
101views more  JAPLL 2007»
15 years 14 days ago
Data-driven type checking in open domain question answering
Many open domain question answering systems answer questions by first harvesting a large number of candidate answers, and then picking the most promising one from the list. One c...
Stefan Schlobach, David Ahn, Maarten de Rijke, Val...
110
Voted
NAR
2000
84views more  NAR 2000»
15 years 10 days ago
SRPDB (Signal Recognition Particle Database)
The Signal Recognition Particle Database (SRPDB) at http://psyche.uthct.edu/dbs/SRPDB/SRPDB.html and http://bio.lundberg.gu.se/dbs/SRPDB/SRPDB. html assists in the better understa...
Christian Zwieb, Tore Samuelsson
111
Voted
JGAA
2002
99views more  JGAA 2002»
15 years 7 days ago
Graph Layout Aesthetics in UML Diagrams: User Preferences
The merit of automatic graph layout algorithms is typically judged by their computational efficiency and the extent to which they conform to aesthetic criteria (for example, minim...
Helen C. Purchase, Jo-Anne Allder, David A. Carrin...
111
Voted
PAMI
2002
86views more  PAMI 2002»
15 years 6 days ago
Recognizing Mathematical Expressions Using Tree Transformation
We describe a robust and efficient system for recognizing typeset and handwritten mathematical notation. From a list of symbols with bounding boxes the system analyzes an expressio...
Richard Zanibbi, Dorothea Blostein, James R. Cordy