Sciweavers

3652 search results - page 439 / 731
» A study of query length
Sort
View
DEDUCTIVE
1994
133views Database» more  DEDUCTIVE 1994»
15 years 6 months ago
Expressive Power of Non-Deterministic Operators for Logic-based Languages
Non-deterministic operators are needed in First-Order relational languages and Datalog to extend the expressive power of such languages and support efficient formulations of lowco...
Luca Corciulo, Fosca Giannotti, Dino Pedreschi, Ca...
CLEF
2010
Springer
15 years 5 months ago
Multilingual Expert Search using Linked Open Data as Interlingual Representation
Abstract. Most Information Retrieval models take documents as Bagof-Words and are thereby bound to the language of the documents. In this paper, we present an approach using Linked...
Daniel Herzig, Hristina Taneva
141
Voted
ICML
2010
IEEE
15 years 5 months ago
Metric Learning to Rank
We study metric learning as a problem of information retrieval. We present a general metric learning algorithm, based on the structural SVM framework, to learn a metric such that ...
Brian McFee, Gert R. G. Lanckriet
173
Voted
APPROX
2010
Springer
135views Algorithms» more  APPROX 2010»
15 years 4 months ago
Monotonicity Testing and Shortest-Path Routing on the Cube
We study the problem of monotonicity testing over the hypercube. As previously observed in several works, a positive answer to a natural question about routing properties of the hy...
Jop Briët, Sourav Chakraborty, David Garc&iac...
CORR
2006
Springer
125views Education» more  CORR 2006»
15 years 4 months ago
10^(10^6) Worlds and Beyond: Efficient Representation and Processing of Incomplete Information
We present a decomposition-based approach to managing probabilistic information. We introduce world-set decompositions (WSDs), a space-efficient and complete representation system ...
Lyublena Antova, Christoph Koch, Dan Olteanu