Sciweavers

2370 search results - page 151 / 474
» A Structured Set of Higher-Order Problems
Sort
View
126
Voted
IJFCS
2006
70views more  IJFCS 2006»
15 years 3 months ago
The Computational Complexity of Avoiding Forbidden Submatrices by Row Deletions
We initiate a systematic study of the Row Deletion(B) problem on matrices: Given an input matrix A and a fixed "forbidden submatrix" B, the task is to remove a minimum n...
Sebastian Wernicke, Jochen Alber, Jens Gramm, Jion...
168
Voted
DBPL
1993
Springer
141views Database» more  DBPL 1993»
15 years 7 months ago
Some Properties of Query Languages for Bags
In this paper we study the expressive power of query languages for nested bags. We de ne the ambient bag language by generalizing the constructs of the relational language of Brea...
Leonid Libkin, Limsoon Wong
PODS
2005
ACM
86views Database» more  PODS 2005»
16 years 3 months ago
Multi-structural databases
We introduce the Multi-Structural Database, a new data framework to support efficient analysis of large, complex data sets. An instance of the model consists of a set of data obje...
Ronald Fagin, Ramanathan V. Guha, Ravi Kumar, Jasm...
170
Voted
DAGM
2004
Springer
15 years 7 months ago
Efficient Face Detection by a Cascaded Support Vector Machine Using Haar-Like Features
Abstract. In this paper, we present a novel method for reducing the computational complexity of a Support Vector Machine (SVM) classifier without significant loss of accuracy. We a...
Matthias Rätsch, Sami Romdhani, Thomas Vetter
95
Voted
NIPS
2003
15 years 4 months ago
Denoising and Untangling Graphs Using Degree Priors
This paper addresses the problem of untangling hidden graphs from a set of noisy detections of undirected edges. We present a model of the generation of the observed graph that in...
Quaid Morris, Brendan J. Frey