Sciweavers

385 search results - page 11 / 77
» Probabilistic ranking over relations
Sort
View
ICML
2000
IEEE
13 years 12 months ago
Discriminative Reranking for Natural Language Parsing
This paper considers approaches which rerank the output of an existing probabilistic parser. The base parser produces a set of candidate parses for each input sentence, with assoc...
Michael Collins
EDBTW
2006
Springer
13 years 11 months ago
Models for Incomplete and Probabilistic Information
Abstract. We discuss, compare and relate some old and some new models for incomplete and probabilistic databases. We characterize the expressive power of c-tables over infinite dom...
Todd J. Green, Val Tannen
SMC
2010
IEEE
124views Control Systems» more  SMC 2010»
13 years 6 months ago
SoftFacts: A top-k retrieval engine for ontology mediated access to relational databases
—We outline SoftFacts, an ontology mediated top-k information retrieval system over relational databases. An ontology layer is used to define (in terms of a OWL-QL like Semantic...
Umberto Straccia
SSDBM
2005
IEEE
184views Database» more  SSDBM 2005»
14 years 1 months ago
Optimizing Multiple Top-K Queries over Joins
Advanced Data Mining applications require more and more support from relational database engines. Especially clustering applications in high dimensional features space demand a pr...
Dirk Habich, Wolfgang Lehner, Alexander Hinneburg
ICDE
2007
IEEE
136views Database» more  ICDE 2007»
14 years 9 months ago
Faceted Browsing over Large Databases of Text-Annotated Objects
We demonstrate a fully working system for multifaceted browsing over large collections of text-annotated data, such as annotated images, that are stored in relational databases. T...
Wisam Dakka, Panagiotis G. Ipeirotis, Kenneth R. W...