Sciweavers

811 search results - page 39 / 163
» Refactoring Using Type Constraints
Sort
View
EMNLP
2011
12 years 8 months ago
Structured Relation Discovery using Generative Models
We explore unsupervised approaches to relation extraction between two named entities; for instance, the semantic bornIn relation between a person and location entity. Concretely, ...
Limin Yao, Aria Haghighi, Sebastian Riedel, Andrew...
ICSE
2010
IEEE-ACM
14 years 1 months ago
An analysis of the variability in forty preprocessor-based software product lines
Over 30 years ago, the preprocessor cpp was developed to extend the programming language C by lightweight metaprogramming capabilities. Despite its error-proneness and low ion lev...
Jörg Liebig, Sven Apel, Christian Lengauer, C...
ICLP
2011
Springer
13 years 3 days ago
Constraints in Non-Boolean Contexts
In high-level constraint modelling languages, constraints can occur in non-Boolean contexts: implicitly, in the form of partial functions, or more explicitly, in the form of const...
Leslie De Koninck, Sebastian Brand, Peter J. Stuck...
ECML
2007
Springer
14 years 2 months ago
Clustering Trees with Instance Level Constraints
Abstract. Constrained clustering investigates how to incorporate domain knowledge in the clustering process. The domain knowledge takes the form of constraints that must hold on th...
Jan Struyf, Saso Dzeroski
PLDI
2004
ACM
14 years 2 months ago
The set constraint/CFL reachability connection in practice
Many program analyses can be reduced to graph reachability problems involving a limited form of context-free language reachability called Dyck-CFL reachability. We show a new redu...
John Kodumal, Alexander Aiken