2252 search results - page 317 / 451 » Lower Bounds for Dynamic Algorithms |
127
Voted
SPAA
2004
ACM
15 years 8 months ago
2004
ACM
This paper considers the problem of packet-mode scheduling of input queuedswitches. Packets have variable lengths, and are divided into cells of unit length. Each packet arrives t...
226
Voted
GIS
2007
ACM
16 years 4 months ago
2007
ACM
In this paper, we present an original network graph embedding to speed-up distance-range and k-nearest neighbor queries in (weighted) graphs. Our approach implements the paradigm ...
113
Voted
CCGRID
2009
IEEE
15 years 10 months ago
2009
IEEE
Volunteer Computing (VC) projects harness the power of computers owned by volunteers across the Internet to perform hundreds of thousands of independent jobs. In VC projects, the ...
242
click to vote
AMMA
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. In this paper, we report on the design of a novel market-based approach for decentralised scheduling across multiple factories. Specifically, because of the limitations ...
165
click to vote
DEXA
2009
Springer
15 years 10 months ago
2009
Springer
Metric access methods (MAMs) serve as a tool for speeding similarity queries. However, all MAMs developed so far are index-based; they need to build an index on a given database. T...