Sciweavers

1656 search results - page 133 / 332
» Labeling Schemes with Queries
Sort
View
PODS
2007
ACM
196views Database» more  PODS 2007»
14 years 9 months ago
On the complexity of managing probabilistic XML data
In [3], we introduced a framework for querying and updating probabilistic information over unordered labeled trees, the probabilistic tree model. The data model is based on trees ...
Pierre Senellart, Serge Abiteboul
ADMA
2006
Springer
167views Data Mining» more  ADMA 2006»
14 years 3 months ago
A Correlation Approach for Automatic Image Annotation
The automatic annotation of images presents a particularly complex problem for machine learning researchers. In this work we experiment with semantic models and multi-class learnin...
David R. Hardoon, Craig Saunders, Sándor Sz...
GG
2004
Springer
14 years 2 months ago
Embedding in Switching Classes with Skew Gains
Abstract. In the context of graph transformation we look at the operation of switching, which can be viewed as an elegant method for realizing global transformations of (group-labe...
Andrzej Ehrenfeucht, Jurriaan Hage, Tero Harju, Gr...
EDBT
1994
ACM
117views Database» more  EDBT 1994»
14 years 1 months ago
Content Routing for Distributed Information Servers
We describe a system that provides query based associative access to the contents of distributed information servers. In typical distributed information systems there are so many o...
Mark A. Sheldon, Andrzej Duda, Ron Weiss, James O'...
EMNLP
2004
13 years 10 months ago
Instance-Based Question Answering: A Data-Driven Approach
Anticipating the availability of large questionanswer datasets, we propose a principled, datadriven Instance-Based approach to Question Answering. Most question answering systems ...
Lucian Vlad Lita, Jaime G. Carbonell