5169 search results - page 923 / 1034 » Locality approximation using time |
168
click to vote
VLDB
2007
ACM
16 years 12 days ago
2007
ACM
The general problem of answering top-k queries can be modeled using lists of data items sorted by their local scores. The most efficient algorithm proposed so far for answering to...
196
click to vote
PODC
2006
ACM
16 years 7 days ago
2006
ACM
Byzantine agreement algorithms typically assume implicit initial state consistency and synchronization among the correct nodes and then operate in coordinated rounds of informatio...
196
click to vote
SWAT
2010
Springer
15 years 11 months ago
2010
Springer
Given a permutation π of {1, . . . , n} and a positive integer k, we give an algorithm with running time 2O(k2 log k) nO(1) that decides whether π can be partitioned into at mos...
167
click to vote
FOCS
2002
IEEE
15 years 11 months ago
2002
IEEE
Two decades ago, Megiddo and Dyer showed that linear programming in two and three dimensions (and subsequently any constant number of dimensions) can be solved in linear time. In ...
168
click to vote
HICSS
2002
IEEE
15 years 11 months ago
2002
IEEE
Contact management is an important part of everyday work. People exchange business cards to try to enter each other’s contact lists. Local businesses provide refrigerator magnet...