Sciweavers

85 search results - page 9 / 17
» Inconsistent heuristics in theory and practice
Sort
View
EKAW
2008
Springer
14 years 11 months ago
Learning Disjointness for Debugging Mappings between Lightweight Ontologies
Abstract. Dealing with heterogeneous ontologies by means of semantic mappings has become an important area of research and a number of systems for discovering mappings between onto...
Christian Meilicke, Johanna Völker, Heiner St...
ISSAC
2009
Springer
150views Mathematics» more  ISSAC 2009»
15 years 4 months ago
On finding multiplicities of characteristic polynomial factors of black-box matrices
We present algorithms and heuristics to compute the characteristic polynomial of a matrix given its minimal polynomial. The matrix is represented as a black-box, i.e., by a functi...
Jean-Guillaume Dumas, Clément Pernet, B. Da...
ICRE
2000
IEEE
15 years 2 months ago
Requirements Documentation: Why a Formal Basis is Essential
Unless you have a complete and precise description of your product’s requirements, it is very unlikely that you will satisfy those requirements. A requirements document that is ...
David Lorge Parnas
ICDE
2008
IEEE
147views Database» more  ICDE 2008»
15 years 11 months ago
Fast Indexes and Algorithms for Set Similarity Selection Queries
Data collections often have inconsistencies that arise due to a variety of reasons, and it is desirable to be able to identify and resolve them efficiently. Set similarity queries ...
Marios Hadjieleftheriou, Amit Chandel, Nick Koudas...
ICDE
2007
IEEE
146views Database» more  ICDE 2007»
15 years 11 months ago
Conditional Functional Dependencies for Data Cleaning
We propose a class of constraints, referred to as conditional functional dependencies (CFDs), and study their applications in data cleaning. In contrast to traditional functional ...
Philip Bohannon, Wenfei Fan, Floris Geerts, Xibei ...