5606 search results - page 969 / 1122 » Randomization Techniques for Graphs. |
151
click to vote
PODC
2006
ACM
16 years 11 days ago
2006
ACM
This paper presents a distributed algorithm for wireless adhoc networks that runs in polylogarithmic number of rounds in the size of the network and constructs a lightweight, line...
168
click to vote
PODC
2005
ACM
15 years 12 months ago
2005
ACM
The problem of verifying a Minimum Spanning Tree (MST) was introduced by Tarjan in a sequential setting. Given a graph and a tree that spans it, the algorithm is required to check...
172
click to vote
CIKM
2005
Springer
15 years 12 months ago
2005
Springer
Despite the recent advances in search quality, the fast increase in the size of the Web collection has introduced new challenges for Web ranking algorithms. In fact, there are sti...
198
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...
201
click to vote
CIVR
2010
Springer
15 years 11 months ago
2010
Springer
This paper describes an approach to optimize query by visual example results, by combining visual features and implicit user feedback in interactive video retrieval. To this end, ...