2924 search results - page 307 / 585 » Lower Bounds in Distributed Computing |
128
click to vote
IPPS
2006
IEEE
15 years 10 months ago
2006
IEEE
In this paper a novel job allocation scheme in distributed systems (TAG) is modelled using the Markovian process algebra PEPA. This scheme requires no prior knowledge of job size ...
120
click to vote
PRDC
2006
IEEE
15 years 10 months ago
2006
IEEE
The finite average response time model is a very weak distributed systems model: it permits runs with unbounded transmission and processing delays and it does not bound the relat...
231
click to vote
ICDE
2006
IEEE
16 years 5 months ago
2006
IEEE
We consider the problem of speeding up Entity Recognition systems that exploit existing large databases of structured entities to improve extraction accuracy. These systems requir...
142
click to vote
ISAAC
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We show how to represent sets in a linear space data structure such that expressions involving unions and intersections of sets can be computed in a worst-case efficient ...
140
click to vote
COMPGEOM
1995
ACM
15 years 8 months ago
1995
ACM
The range searching problem is a fundamental problem in computational geometry, with numerous important applications. Most research has focused on solving this problem exactly, bu...