2168 search results - page 245 / 434 » Randomized Algorithms and Complexity Theory |
235
Voted
ICDE
2008
IEEE
16 years 5 months ago
2008
IEEE
This work introduces novel polynomial algorithms for processing top-k queries in uncertain databases under the generally adopted model of x-relations. An x-relation consists of a n...
149
Voted
ICALP
2010
Springer
15 years 5 months ago
2010
Springer
We present a new deterministic sorting algorithm that interleaves the partitioning of a sample sort with merging. Sequentially, it sorts n elements in O(n log n) time cache-oblivi...
125
Voted
NOSSDAV
2004
Springer
15 years 9 months ago
2004
Springer
Despite many years of research, fair queuing still faces a number of implementation challenges in high speed routers. In particular, in spite of proposals such as DiffServ, the st...
151
Voted
AGP
1999
IEEE
15 years 8 months ago
1999
IEEE
Disunification is the problem of deciding satisfiability of a system of equations and disequations with respect to a given equational theory. In this paper we study the disunifica...
161
Voted
LPNMR
1995
Springer
15 years 7 months ago
1995
Springer
In this paper we propose a version of default logic with the following two properties: (1) defaults with mutually inconsistent justications are never used together in constructing ...