Sciweavers

2635 search results - page 27 / 527
» Algorithms for the Database Layout Problem
Sort
View
80
Voted
KDD
2010
ACM
223views Data Mining» more  KDD 2010»
15 years 4 months ago
An efficient algorithm for a class of fused lasso problems
The fused Lasso penalty enforces sparsity in both the coefficients and their successive differences, which is desirable for applications with features ordered in some meaningful w...
Jun Liu, Lei Yuan, Jieping Ye
EVOW
2003
Springer
15 years 7 months ago
A Genetic Algorithm for the Index Selection Problem
This paper considers the problem of minimizing the response time for a given database workload by a proper choice of indexes. This problem is NP-hard and known in the literature as...
Jozef Kratica, Ivana Ljubic, Dusan Tosic
ICDE
2007
IEEE
126views Database» more  ICDE 2007»
16 years 3 months ago
Efficient Approximation Algorithms for Repairing Inconsistent Databases
We consider the problem of repairing a database that is inconsistent wrt a set of integrity constraints by updating numerical values. In particular, we concentrate on denial integ...
Andrei Lopatenko, Loreto Bravo
ICDT
2009
ACM
135views Database» more  ICDT 2009»
15 years 9 months ago
Repair checking in inconsistent databases: algorithms and complexity
Managing inconsistency in databases has long been recognized as an important problem. One of the most promising approaches to coping with inconsistency in databases is the framewo...
Foto N. Afrati, Phokion G. Kolaitis
DATESO
2009
121views Database» more  DATESO 2009»
15 years 6 days ago
Translation of Ontology Retrieval Problem into Relational Queries
Ontology as a knowledge base can provide different reasoning tasks, e.g. to check consistency of the ontology or to check whether a resource is instance of a concept or not. In thi...
Jaroslav Pokorný, Jana Pribolová, Pe...