779 search results - page 94 / 156 » Determining Time of Queries for Re-ranking Search Results |
245
click to vote
SIGMOD
2008
ACM
16 years 6 months ago
2008
ACM
Structured peer-to-peer (P2P) overlays have been successfully employed in many applications to locate content. However, they have been less effective in handling massive amounts o...
147
click to vote
MKM
2007
Springer
16 years 9 days ago
2007
Springer
To be effective and useful, math search systems must not only maximize precision and recall, but also present the query hits in a form that makes it easy for the user to identify...
165
click to vote
EDBT
2004
ACM
16 years 6 months ago
2004
ACM
The join operation, which combines tuples from multiple relations, is the most fundamental and, typically, the most expensive operation in database queries. The standard approach t...
160
click to vote
ADBIS
2003
Springer
15 years 11 months ago
2003
Springer
Let a tuple of n objects obeying a query graph (QG) be called the n-tuple. The “Ddistance-value” of this n-tuple is the value of a linear function of distances of the n objects...
277
click to vote
ICDE
2002
IEEE
16 years 7 months ago
2002
IEEE
Nearest Neighbor search is an important and widely used problem in a number of important application domains. In many of these domains, the dimensionality of the data representati...