Sciweavers

1071 search results - page 24 / 215
» Theories of Automatic Structures and Their Complexity
Sort
View
COLING
1996
13 years 9 months ago
Top-Down Predictive Linking and Complex-Feature-Based Formalisms
Automatic compilation of the linking relation employed in certain parsing algorithms for context-free languages is examined. Special problems arise in the extension of these algor...
James Kilbury
SIGIR
2012
ACM
11 years 10 months ago
Automatic suggestion of query-rewrite rules for enterprise search
Enterprise search is challenging for several reasons, notably the dynamic terminology and jargon that are specific to the enterprise domain. This challenge is partly addressed by...
Zhuowei Bao, Benny Kimelfeld, Yunyao Li
ARTMED
2006
80views more  ARTMED 2006»
13 years 8 months ago
A formal theory for spatial representation and reasoning in biomedical ontologies
Objective: The objective of this paper is to demonstrate how a formal spatial theory can be used as an important tool for disambiguating the spatial information embodied in biomed...
Maureen Donnelly, Thomas Bittner, Cornelius Rosse
POPL
2009
ACM
14 years 8 months ago
The theory of deadlock avoidance via discrete control
Deadlock in multithreaded programs is an increasingly important problem as ubiquitous multicore architectures force parallelization upon an ever wider range of software. This pape...
Manjunath Kudlur, Scott A. Mahlke, Stéphane...
ISPAN
1996
IEEE
14 years 5 days ago
Design and evaluation of an environment APE for automatic parallelization of programs
In this paper, we have presented the design and evaluation of a compiler system, called APE,for automatic parallelization of scientific and engineering applications on distributed...
Vipin Chaudhary, Cheng-Zhong Xu, Sumit Roy, Jialin...