Sciweavers

2783 search results - page 235 / 557
» The Nature Of Near-Synonymic Relations
Sort
View
ALT
2003
Springer
15 years 10 months ago
On the Learnability of Erasing Pattern Languages in the Query Model
A pattern is a finite string of constant and variable symbols. The erasing language generated by a pattern p is the set of all strings that can be obtained by substituting (possib...
Steffen Lange, Sandra Zilles
ICSE
2009
IEEE-ACM
15 years 8 months ago
Automatically capturing source code context of NL-queries for software maintenance and reuse
As software systems continue to grow and evolve, locating code for maintenance and reuse tasks becomes increasingly difficult. Existing static code search techniques using natura...
Emily Hill, Lori L. Pollock, K. Vijay-Shanker
100
Voted
APPROX
2009
Springer
85views Algorithms» more  APPROX 2009»
15 years 8 months ago
Algorithmic Aspects of Property Testing in the Dense Graphs Model
In this paper we consider two basic questions regarding the query complexity of testing graph properties in the adjacency matrix model. The first question refers to the relation ...
Oded Goldreich, Dana Ron
90
Voted
ESWS
2009
Springer
15 years 8 months ago
Towards Linguistically Grounded Ontologies
Abstract. In this paper we argue why it is necessary to associate linguistic information with ontologies and why more expressive models, beyond RDFS, OWL and SKOS, are needed to ca...
Paul Buitelaar, Philipp Cimiano, Peter Haase, Mich...
MODELS
2009
Springer
15 years 8 months ago
Generic Model Refactorings
Many modeling languages share some common concepts and principles. For example, Java, MOF, and UML share some aspects of the concepts of classes, methods, attributes, and inheritan...
Naouel Moha, Vincent Mahé, Olivier Barais, ...