2252 search results - page 190 / 451 » Lower Bounds for Dynamic Algorithms |
148
Voted
4OR
2010
15 years 2 months ago
2010
This a summary of the author's PhD thesis supervised by Leo Liberti, Philippe Baptiste and Daniel Krob and defended on 18 June 2009 at Ecole Polytechnique, Palaiseau, France. ...
137
Voted
FCCM
2000
IEEE
15 years 8 months ago
2000
IEEE
Although run-time reconfigurable systems have been shown to achieve very high performance, the speedups over traditional microprocessor systems are limited by the cost of configur...
159
Voted
PODC
2011
ACM
14 years 6 months ago
2011
ACM
We study several variants of coordinated consensus in dynamic networks. We assume a synchronous model, where the communication graph for each round is chosen by a worst-case adver...
118
click to vote
MFCS
2001
Springer
15 years 8 months ago
2001
Springer
In the traveling repairman problem (Trp), a tour must be found through every one of a set of points (cities) in some metric space such that the weighted sum of completion times of ...
132
Voted
PAMI
2008
15 years 3 months ago
2008
Abstract-Similarity searching often reduces to finding the k nearest neighbors to a query object. Finding the k nearest neighbors is achieved by applying either a depth-first or a ...