195 search results - page 35 / 39 » Hiding the complexity of LBS |
IEEEPACT
2005
IEEE
14 years 1 months ago
2005
IEEE
Hiding communication latency is an important optimization for parallel programs. Programmers or compilers achieve this by using non-blocking communication primitives and overlappi...
IEEEPACT
2005
IEEE
14 years 1 months ago
2005
IEEE
Current integration trends embrace the prosperity of single-chip multi-core processors. Although multi-core processors deliver significantly improved system throughput, single-thr...
OTM
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We introduce XMLVM, a Turing complete XML-based programming language based on a stack-based, virtual machine. We show how XMLVM can automatically be created from Java cla...
ACMICEC
2004
ACM
14 years 1 months ago
2004
ACM
This paper presents a loosely coupled service-composition paradigm. This paradigm employs a distributed data flow that differs markedly from centralized information flow adopted b...
COMPGEOM
2010
ACM
14 years 21 days ago
2010
ACM
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...