Results 21  30
of
23,623
Duplicate record detection: A survey
 TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING
, 2007
"... Often, in the real world, entities have two or more representations in databases. Duplicate records do not share a common key and/or they contain errors that make duplicate matching a dif cult task. Errors are introduced as the result of transcription errors, incomplete information, lack of standard ..."
Abstract

Cited by 427 (11 self)
 Add to MetaCart
Often, in the real world, entities have two or more representations in databases. Duplicate records do not share a common key and/or they contain errors that make duplicate matching a dif cult task. Errors are introduced as the result of transcription errors, incomplete information, lack of standard formats or any combination of these factors. In this article, we present a thorough analysis of the literature on duplicate record detection. We cover similarity metrics that are commonly used to detect similar eld entries, and we present an extensive set of duplicate detection algorithms that can detect approximately duplicate records in a database. We also cover multiple techniques for improving the ef ciency and scalability of approximate duplicate detection algorithms. We conclude with a coverage of existing tools and with a brief discussion of the big open problems in the area.
Unweighted Coalitional Manipulation Under the Borda Rule Is NPHard
 PROCEEDINGS OF THE TWENTYSECOND INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE
"... The Borda voting rule is a positional scoring rule where, for m candidates, for every vote the first candidate receives m − 1 points, the second m − 2 points and so on. A Borda winner is a candidate with highest total score. It has been a prominent open problem to determine the computational complex ..."
Abstract

Cited by 32 (2 self)
 Add to MetaCart
complexity of UNWEIGHTED COALITIONAL MANIPULATION UNDER BORDA: Can one add a certain number of additional votes (called manipulators) to an election such that a distinguished candidate becomes a winner? We settle this open problem by showing NPhardness even for two manipulators and three input votes
VertexPartitioning into Fixed Additive InducedHereditary Properties Is NPhard
 J. Combin. Cit
, 2004
"... Can the vertices of an arbitrary graph G be partitioned into A∪B, so that G[A] is a linegraph and G[B] is a forest? Can G be partitioned into a planar graph and a perfect graph? The NPcompleteness of these problems are special cases of our result: if P and Q are additive inducedhereditary ..."
Abstract

Cited by 21 (4 self)
 Add to MetaCart
hereditary graph properties, then (P,Q)colouring is NPhard, with the sole exception of graph 2colouring (the case where both P and Q are the Set O of finite edgeless graphs). Moreover, (P,Q)colouring is NPcomplete iff P and Qrecognition are both in NP. This completes the proof of a conjecture of Kratochvíl
Structured Semidefinite Programs and Semialgebraic Geometry Methods in Robustness and Optimization
, 2000
"... ..."
The multivariate resultant is NPhard in any characteristic,” pp. 477– 488
 in P. Hliněn´y and A. Kučera (Eds), Mathematical Foundations of Computer Science (MFCS), Lecture Notes in Computer Science, 6281
, 2010
"... Abstract. The multivariate resultant is a fundamental tool of computational algebraic geometry. It can in particular be used to decide whether a system of n homogeneous equations in n variables is satisfiable (the resultant is a polynomial in the system’s coefficients which vanishes if and only if t ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
if the system is satisfiable). In this paper we present several NPhardness results for testing whether a multivariate resultant vanishes, or equivalently for deciding whether a square system of homogeneous equations is satisfiable. Our main result is that testing the resultant for zero is NPhard under
SpaceTime Assumptions Behind NPHardness of Propositional Satisfiability
"... For some problems, we know feasible algorithms for solving them. Other computational problems (such as propositional satisfiability) are known to be NPhard, which means that, unless P=NP (which most computer scientists believe to be impossible), no feasible algorithm is possible for solving all pos ..."
Abstract
 Add to MetaCart
For some problems, we know feasible algorithms for solving them. Other computational problems (such as propositional satisfiability) are known to be NPhard, which means that, unless P=NP (which most computer scientists believe to be impossible), no feasible algorithm is possible for solving all
Results 21  30
of
23,623