587 search results - page 49 / 118 » Theory of matching pursuit |
KAIS
2006
13 years 10 months ago
2006
Abstract It has been proven that districted matching schemes (e.g., the US presidential election scheme, also called the Electoral College) are more stable than undistricted matchi...
LICS
2008
IEEE
14 years 5 months ago
2008
IEEE
This paper presents a new bisimulation theory for parametric polymorphism which enables straightforward coinductive proofs of program equivalences involving existential types. The...
CIMCA
2005
IEEE
14 years 4 months ago
2005
IEEE
The aim of the research presented in this paper is to contribute to reduction of development time for ontologies by discovering reusable parts and patterns. The approach is to use...
SIAMCOMP
2008
13 years 10 months ago
2008
Leslie Valiant recently proposed a theory of holographic algorithms. These novel algorithms achieve exponential speed-ups for certain computational problems compared to naive algo...
ATAL
2007
Springer
14 years 5 months ago
2007
Springer
Ontology matching is currently a key technology to achieve the semantic alignment of ontological entities used by knowledge-based applications, and therefore to enable their inter...