Sciweavers

8647 search results - page 432 / 1730
» The Container Selection Problem
Sort
View
169
Voted
FOCS
1998
IEEE
15 years 9 months ago
The Complexity of Acyclic Conjunctive Queries
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
Georg Gottlob, Nicola Leone, Francesco Scarcello
SIGMOD
2002
ACM
118views Database» more  SIGMOD 2002»
16 years 5 months ago
Compressing SQL workloads
Recently several important relational database tasks such as index selection, histogram tuning, approximate query processing, and statistics selection have recognized the importan...
Surajit Chaudhuri, Ashish Kumar Gupta, Vivek R. Na...
IJCNN
2006
IEEE
15 years 11 months ago
A Heuristic for Free Parameter Optimization with Support Vector Machines
— A heuristic is proposed to address free parameter selection for Support Vector Machines, with the goals of improving generalization performance and providing greater insensitiv...
Matthew Boardman, Thomas P. Trappenberg
112
Voted
UC
2005
Springer
15 years 10 months ago
Quantum Searching Amidst Uncertainty
Consider a database most of whose entries are marked but the precise fraction of marked entries is not known. What is known is that the fraction of marked entries is 1 − , where ...
Lov K. Grover
ICDAR
2003
IEEE
15 years 10 months ago
Investigation of Off-Line Japanese Signature Verification Using a Pattern Matching
This paper deals with an off-line Japanese signature verification using a pattern matching method. An annoying problem encountered in off-line signature verification using a patte...
Katsuhiko Ueda