Sciweavers

2635 search results - page 104 / 527
» Algorithms for the Database Layout Problem
Sort
View
PKDD
2009
Springer
135views Data Mining» more  PKDD 2009»
15 years 10 months ago
Syntactic Structural Kernels for Natural Language Interfaces to Databases
A core problem in data mining is to retrieve data in a easy and human friendly way. Automatically translating natural language questions into SQL queries would allow for the design...
Alessandra Giordani, Alessandro Moschitti
ISI
2002
Springer
15 years 3 months ago
Getting right answers from incomplete multidimensional databases
Dealing with large volumes of data, OLAP data cubes aggregated values are often spoiled by errors due to missing values in detailed data. This paper suggests to adjust aggregate an...
Sabine Goutier, Georges Hébrail, Vér...
PODS
2008
ACM
123views Database» more  PODS 2008»
16 years 4 months ago
Evaluating rank joins with optimal cost
In the rank join problem, we are given a set of relations and a scoring function, and the goal is to return the join results with the top K scores. It is often the case in practic...
Karl Schnaitter, Neoklis Polyzotis
DOCENG
2006
ACM
15 years 10 months ago
Minimum sized text containment shapes
In many text-processing applications, we would like shapes that expand (or shrink) in size to fit their textual content. We address how to efficiently compute the minimum size fo...
Nathan Hurst, Kim Marriott, Peter Moulder
ECCV
2000
Springer
16 years 6 months ago
Learning Over Multiple Temporal Scales in Image Databases
Abstract. The ability to learn from user interaction is an important asset for content-based image retrieval (CBIR) systems. Over short times scales, it enables the integration of ...
Nuno Vasconcelos, Andrew Lippman