2621 search results - page 338 / 525 » Near orders and codes |
284
click to vote
ICDE
2006
IEEE
16 years 8 months ago
2006
IEEE
Scheduling/prioritization of DBMS transactions is important for many applications that rely on database backends. A convenient way to achieve scheduling is to limit the number of ...
286
click to vote
ICDE
2003
IEEE
16 years 8 months ago
2003
IEEE
In many database applications involving string data, it is common to have near neighbor queries (asking for strings that are similar to a query string) or nearest neighbor queries...
179
click to vote
PPOPP
2009
ACM
16 years 7 months ago
2009
ACM
Load balancing is a technique which allows efficient parallelization of irregular workloads, and a key component of many applications and parallelizing runtimes. Work-stealing is ...
194
click to vote
KDD
2008
ACM
16 years 7 months ago
2008
ACM
This work introduces a new family of link-based dissimilarity measures between nodes of a weighted directed graph. This measure, called the randomized shortest-path (RSP) dissimil...
170
click to vote
CHI
2007
ACM
16 years 7 months ago
2007
ACM
Web search engines present search results in a rank ordered list. This works when what a user wants is near the top, but sometimes the information that the user really wants is lo...