Sciweavers

2638 search results - page 113 / 528
» Extracting Approximate Patterns
Sort
View
ACL
2008
15 years 6 months ago
Classification of Semantic Relationships between Nominals Using Pattern Clusters
There are many possible different semantic relationships between nominals. Classification of such relationships is an important and difficult task (for example, the well known nou...
Dmitry Davidov, Ari Rappoport
INFSOF
2000
122views more  INFSOF 2000»
15 years 4 months ago
Component mining: a process and its pattern language
An important issue in a component-based software development process is the supply source of mature, reliable, adaptable, and maintainable components. We define as component minin...
Diomidis Spinellis, K. Raptis
FOCS
2003
IEEE
15 years 9 months ago
Approximation Algorithms for Asymmetric TSP by Decomposing Directed Regular Multigraphs
A directed multigraph is said to be d-regular if the indegree and outdegree of every vertex is exactly d. By Hall’s theorem one can represent such a multigraph as a combination ...
Haim Kaplan, Moshe Lewenstein, Nira Shafrir, Maxim...
TODS
2002
92views more  TODS 2002»
15 years 4 months ago
Searching in metric spaces with user-defined and approximate distances
Metric access methods (MAMs), such as the M-tree, are powerful index structures for supporting ty queries on metric spaces, which represent a common abstraction for those searchin...
Paolo Ciaccia, Marco Patella
TLDI
2009
ACM
142views Formal Methods» more  TLDI 2009»
16 years 1 months ago
Static extraction of sound hierarchical runtime object graphs
For many object-oriented systems, it is often useful to have a runtime architecture that shows networks of communicating objects. But it is hard to statically extract runtime obje...
Marwan Abi-Antoun, Jonathan Aldrich