8724 search results - page 222 / 1745 » Search result diversification |
305
Voted
ICDE
2009
IEEE
16 years 8 months ago
2009
IEEE
A common approach to performing keyword search over relational databases is to find the minimum Steiner trees in database graphs. These methods, however, are rather expensive as th...
149
click to vote
ICIP
1998
IEEE
16 years 8 months ago
1998
IEEE
Motion estimation represents the most computationally intensive task for all efficient motion compensated compression standards. This fact, despite the several eflorts aiming at r...
306
click to vote
ICDE
2002
IEEE
16 years 8 months ago
2002
IEEE
With the growth of the Web, there has been a rapid increase in the number of users who need to access online databases without having a detailed knowledge of the schema or of quer...
194
click to vote
STOC
2006
ACM
16 years 7 months ago
2006
ACM
Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexi...
312
click to vote
VLDB
2007
ACM
16 years 6 months ago
2007
ACM
Given a multidimensional point q, a reverse k nearest neighbor (RkNN) query retrieves all the data points that have q as one of their k nearest neighbors. Existing methods for proc...