8746 search results - page 223 / 1750 » Diversifying search results |
GI
2009
Springer
14 years 10 months ago
2009
Springer
: In this paper we explore the possibilities to perform the search for results of non-deterministic computations in parallel. We present three different approaches to this problem:...
228
click to vote
ICDE
2009
IEEE
16 years 2 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...
84
Voted
ICIP
1998
IEEE
16 years 2 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...
220
Voted
ICDE
2002
IEEE
16 years 2 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...
122
Voted
STOC
2006
ACM
16 years 1 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...