Sciweavers

327 search results - page 11 / 66
» Some Elimination Problems for Matrices
Sort
View
DEXA
2004
Springer
147views Database» more  DEXA 2004»
14 years 3 months ago
A Flexible Fuzzy Expert System for Fuzzy Duplicate Elimination in Data Cleaning
Data cleaning deals with the detection and removal of errors and inconsistencies in data, gathered from distributed sources. This process is essential for drawing correct conclusio...
Hamid Haidarian Shahri, Ahmad Abdollahzadeh Barfor...
FCT
2003
Springer
14 years 3 months ago
Graph Searching, Elimination Trees, and a Generalization of Bandwidth
The bandwidth minimization problem has a long history and a number of practical applications. In this paper we introduce a natural extension of bandwidth to partially ordered layo...
Fedor V. Fomin, Pinar Heggernes, Jan Arne Telle
ICTAI
2003
IEEE
14 years 3 months ago
Eliminating Redundancies in SAT Search Trees
Conflict analysis is a powerful paradigm of backtrack search algorithms, in particular for solving satisfiability problems arising from practical applications. Accordingly, most...
Richard Ostrowski, Bertrand Mazure, Lakhdar Sais, ...
ISAAC
2007
Springer
158views Algorithms» more  ISAAC 2007»
14 years 4 months ago
On the Expressive Power of Planar Perfect Matching and Permanents of Bounded Treewidth Matrices
Valiant introduced some 25 years ago an algebraic model of computation along with the complexity classes VP and VNP, which can be viewed as analogues of the classical classes P and...
Uffe Flarup, Pascal Koiran, Laurent Lyaudet
BMCBI
2008
166views more  BMCBI 2008»
13 years 10 months ago
Biclustering via optimal re-ordering of data matrices in systems biology: rigorous methods and comparative studies
Background: The analysis of large-scale data sets via clustering techniques is utilized in a number of applications. Biclustering in particular has emerged as an important problem...
Peter A. DiMaggio Jr., Scott R. McAllister, Christ...