Sciweavers

210 search results - page 40 / 42
» types 1994
Sort
View
LCC
1994
248views Algorithms» more  LCC 1994»
13 years 11 months ago
Comparing the Power of Monadic NP Games
The descriptive complexity of a problem is the complexity of describing the problem in some logical formalism. One of the few techniques for proving separation results in descripti...
Ronald Fagin
SIGMOD
1994
ACM
106views Database» more  SIGMOD 1994»
13 years 11 months ago
Multi-Step Processing of Spatial Joins
Spatial joins are one of the most important operations for combining spatial objects of several relations. In this paper, spatial join processing is studied in detail for extended...
Thomas Brinkhoff, Hans-Peter Kriegel, Ralf Schneid...
TAGT
1994
Springer
185views Graph Theory» more  TAGT 1994»
13 years 11 months ago
Concatenation of Graphs
An operation of concatenation is introduced for graphs. Then strings are viewed as expressions denoting graphs, and string languages are interpreted as graph languages. For a clas...
Joost Engelfriet, Jan Joris Vereijken
VLDB
1994
ACM
118views Database» more  VLDB 1994»
13 years 11 months ago
Query Optimization by Predicate Move-Around
A new type of optimization, called predicate move-around, ia introduced. It is shown how this optimization `considerably improvea the efficiency of evaluating SQL queries that hav...
Alon Y. Levy, Inderpal Singh Mumick, Yehoshua Sagi...
IJCAI
2003
13 years 9 months ago
Integrating Background Knowledge Into Text Classification
We present a description of three different algorithms that use background knowledge to improve text classifiers. One uses the background knowledge as an index into the set of tra...
Sarah Zelikovitz, Haym Hirsh