Sciweavers

2100 search results - page 13 / 420
» Fundamentals of the problem
Sort
View
ICDT
2007
ACM
107views Database» more  ICDT 2007»
14 years 1 months ago
Some Algorithmic Improvements for the Containment Problem of Conjunctive Queries with Negation
Query containment is a fundamental problem of databases. Given two queries q1 and q2, it asks whether the set of answers to q1 is included in the set of answers to q2 for any datab...
Michel Leclère, Marie-Laure Mugnier
IPM
2002
102views more  IPM 2002»
13 years 7 months ago
Problems of music information retrieval in the real world
Although a substantial number of research projects have addressed music information retrieval over the past three decades, the field is still very immature. Few of these projects ...
Donald Byrd, Tim Crawford
SIAMCOMP
2010
172views more  SIAMCOMP 2010»
13 years 2 months ago
Deterministic Polynomial Time Algorithms for Matrix Completion Problems
We present new deterministic algorithms for several cases of the maximum rank matrix completion problem (for short matrix completion), i.e. the problem of assigning values to the ...
Gábor Ivanyos, Marek Karpinski, Nitin Saxen...
WEA
2005
Springer
176views Algorithms» more  WEA 2005»
14 years 1 months ago
High-Performance Algorithm Engineering for Large-Scale Graph Problems and Computational Biology
Abstract. Many large-scale optimization problems rely on graph theoretic solutions; yet high-performance computing has traditionally focused on regular applications with high degre...
David A. Bader
ALIFE
2000
13 years 7 months ago
Open Problems in Artificial Life
This article lists fourteen open problems in artificial life, each of which is a grand challenge requiring a major advance on a fundamental issue for its solution. Each problem is ...
Mark A. Bedau, John S. McCaskill, Norman H. Packar...