Sciweavers

1804 search results - page 155 / 361
» Ranking for data repairs
Sort
View
AUTOMATICA
2008
139views more  AUTOMATICA 2008»
15 years 6 months ago
Structured low-rank approximation and its applications
Fitting data by a bounded complexity linear model is equivalent to low-rank approximation of a matrix constructed from the data. The data matrix being Hankel structured is equival...
Ivan Markovsky
ICDE
2007
IEEE
124views Database» more  ICDE 2007»
16 years 7 months ago
Topology Search over Biological Databases
We introduce the notion of a data topology and the problem of topology search over databases. A data topology summarizes the set of all possible relationships that connect a given...
Lin Guo, Jayavel Shanmugasundaram, Golan Yona
WSDM
2009
ACM
140views Data Mining» more  WSDM 2009»
16 years 24 days ago
Effective latent space graph-based re-ranking model with global consistency
Recently the re-ranking algorithms have been quite popular for web search and data mining. However, one of the issues is that those algorithms treat the content and link informati...
Hongbo Deng, Michael R. Lyu, Irwin King
ECAI
2008
Springer
15 years 7 months ago
Combining Abduction with Conflict-based Diagnosis
Abstract. Conflict-based diagnosis is a recently proposed probabilistic method for model-based diagnosis, inspired by consistencybased diagnosis, that uses a measure of data confli...
Ildikó Flesch, Peter J. F. Lucas
AMSTERDAM
2009
15 years 3 months ago
Quantifiers and Working Memory
The paper presents a study examining the role of working memory in quantifier verification. We created situations similar to the span task to compare numerical quantifiers of low a...
Jakub Szymanik, Marcin Zajenkowski