Sciweavers

8706 search results - page 1706 / 1742
» Learning Subjective Language
Sort
View
FOCS
1998
IEEE
14 years 1 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
VRML
1998
ACM
14 years 1 months ago
The Peloton Bicycling Simulator
Peloton is a sports simulator that uses the Virtual Reality Modeling Language (VRML) to create virtual environments for athletic training and competition. In particular, it create...
Gianpaolo U. Carraro, Mauricio Cortes, John T. Edm...
ICDT
2010
ACM
195views Database» more  ICDT 2010»
14 years 1 months ago
Answering Non-Monotonic Queries in Relational Data Exchange
Relational data exchange deals with translating a relational database instance over some source schema into a relational database instance over some target schema, according to a ...
André Hernich
COCO
1994
Springer
140views Algorithms» more  COCO 1994»
14 years 1 months ago
Random Debaters and the Hardness of Approximating Stochastic Functions
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...
Anne Condon, Joan Feigenbaum, Carsten Lund, Peter ...
ESA
1993
Springer
109views Algorithms» more  ESA 1993»
14 years 1 months ago
Optimal Upward Planarity Testing of Single-Source Digraphs
A digraph is upward planar if it has a planar drawing such that all the edges are monotone with respect to the vertical direction. Testing upward planarity and constructing upward ...
Paola Bertolazzi, Giuseppe Di Battista, Carlo Mann...
« Prev « First page 1706 / 1742 Last » Next »