Sciweavers

789 search results - page 85 / 158
» On Theory Revision with Queries
Sort
View
CSR
2007
Springer
15 years 7 months ago
Marrying Words and Trees
Traditionally, data that has both linear and hierarchical structure, such as annotated linguistic data, is modeled using ordered trees and queried using tree automata. In this pap...
Rajeev Alur
78
Voted
SAC
2005
ACM
15 years 6 months ago
An information retrieval model using the fuzzy proximity degree of term occurences
Based on the idea that the closer the query terms in a document are, the more relevant this document is, we propose a mathematical model of information retrieval based on a fuzzy ...
Michel Beigbeder, Annabelle Mercier
SIGIR
2003
ACM
15 years 6 months ago
SETS: search enhanced by topic segmentation
We present SETS, an architecture for efficient search in peer-to-peer networks, building upon ideas drawn from machine learning and social network theory. The key idea is to arran...
Mayank Bawa, Gurmeet Singh Manku, Prabhakar Raghav...
111
Voted
TREC
2004
15 years 2 months ago
Can We Get A Better Retrieval Function From Machine?
The quality of an information retrieval system heavily depends on its retrieval function, which returns a similarity measurement between the query and each document in the collect...
Weiguo Fan, Wensi Xi, Edward A. Fox, Li Wang
116
Voted
SIGECOM
2008
ACM
155views ECommerce» more  SIGECOM 2008»
15 years 22 days ago
Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions
We provide tight information-theoretic lower bounds for the welfare maximization problem in combinatorial auctions. In this problem, the goal is to partition m items among k bidde...
Vahab S. Mirrokni, Michael Schapira, Jan Vondr&aac...