Sciweavers

332 search results - page 18 / 67
» Space Complexity vs. Query Complexity
Sort
View
VLDB
1991
ACM
134views Database» more  VLDB 1991»
15 years 5 months ago
Extending the Search Strategy in a Query Optimizer
In order to cope efficiently with simple or complex queries as well as different application requirements (e.g., ad-hoc versus repetitive queries), a query optimizer ought to supp...
Rosana S. G. Lanzelotte, Patrick Valduriez
147
Voted
CVDB
2004
ACM
15 years 7 months ago
Nearest Neighbor Search on Multimedia Indexing Structures
Nearest Neighbor Search on Multimedia Indexing Structures Multimedia databases get larger and larger in our days, and this trend is expected to continue in the future. There are v...
Thomas Seidl
CNL
2009
15 years 3 months ago
Controlled English Ontology-Based Data Access
Abstract. As it is well-known, querying and managing structured data in natural language is a challenging task due to its ambiguity (syntactic and semantic) and its expressiveness....
Camilo Thorne, Diego Calvanese
112
Voted
ICML
2010
IEEE
15 years 3 months ago
Large Scale Max-Margin Multi-Label Classification with Priors
We propose a max-margin formulation for the multi-label classification problem where the goal is to tag a data point with a set of pre-specified labels. Given a set of L labels, a...
Bharath Hariharan, Lihi Zelnik-Manor, S. V. N. Vis...
EDBT
2008
ACM
150views Database» more  EDBT 2008»
16 years 2 months ago
Finding time-dependent shortest paths over large graphs
The spatial and temporal databases have been studied widely and intensively over years. In this paper, we study how to answer queries of finding the best departure time that minim...
Bolin Ding, Jeffrey Xu Yu, Lu Qin