Sciweavers

933 search results - page 27 / 187
» Fully automatic cross-associations
Sort
View
FMSD
2008
110views more  FMSD 2008»
15 years 6 months ago
Automatic symbolic compositional verification by learning assumptions
Abstract Compositional reasoning aims to improve scalability of verification tools by reducing the original verification task into subproblems. The simplification is typically base...
Wonhong Nam, P. Madhusudan, Rajeev Alur
ENVSOFT
2006
122views more  ENVSOFT 2006»
15 years 6 months ago
Automatic identification of oil spills on satellite images
A fully automated system for the identification of possible oil spills present on Synthetic Aperture Radar (SAR) satellite images based on artificial intelligence fuzzy logic has ...
Iphigenia Keramitsoglou, Constantinos Cartalis, Ch...
IPPS
1998
IEEE
15 years 10 months ago
Experimental Study of Compiler Techniques for NUMA Machines
This study1 explores the applicability of fully automatic parallelizing techniques for parallel computers. In this study, we capitalize on a variety of traditional compiling techn...
Yunheung Paek, David A. Padua
EMNLP
2007
15 years 7 months ago
Instance Based Lexical Entailment for Ontology Population
In this paper we propose an instance based method for lexical entailment and apply it to automatic ontology population from text. The approach is fully unsupervised and based on k...
Claudio Giuliano, Alfio Massimiliano Gliozzo
NAACL
2001
15 years 7 months ago
Tree-Cut and a Lexicon Based on Systematic Polysemy
This paper describes a lexicon organized around systematic polysemy: a set of word senses that are related in systematic and predictable ways. The lexicon is derived by a fully au...
Noriko Tomuro