Sciweavers

2124 search results - page 165 / 425
» Aggregating time partitions
Sort
View
142
Voted
LCR
2000
Springer
129views System Software» more  LCR 2000»
15 years 7 months ago
Run-Time Support for Distributed Sharing in Typed Languages
We present a new run-time system for typed programming languages that supports object sharing in a distributed system. The key insight in this system is that the ability to distin...
Y. Charlie Hu, Weimin Yu, Alan L. Cox, Dan S. Wall...
ICDE
2006
IEEE
137views Database» more  ICDE 2006»
16 years 5 months ago
Finding Fastest Paths on A Road Network with Speed Patterns
This paper proposes and solves the Time-Interval All Fastest Path (allFP) query. Given a user-defined leaving or arrival time interval I, a source node s and an end node e, allFP ...
Evangelos Kanoulas, Yang Du, Tian Xia, Donghui Zha...
COMPGEOM
2009
ACM
15 years 10 months ago
Shooting permanent rays among disjoint polygons in the plane
We present a data structure for ray shooting-and-insertion in the free space among disjoint polygonal obstacles with a total of n vertices in the plane, where each ray starts at t...
Mashhood Ishaque, Bettina Speckmann, Csaba D. T&oa...
CGI
1998
IEEE
15 years 8 months ago
Memory Management Schemes for Radiosity Computation in Complex Environments
Hierarchical radiosity is a very demanding process in terms of computation time and memory ressources even for scenes of moderate complexity. To handle complex environments, not f...
Daniel Meneveaux, Kadi Bouatouch, Eric Maisel
PAAPP
1998
149views more  PAAPP 1998»
15 years 3 months ago
Optimal Mesh Algorithms for Proximity and Visibility Problems in Simple Polygons*
We present optimal parallel algorithms that run in O( pn) time on a pn pn meshconnected computer for a number of fundamental problems concerning proximity and visibility in a simp...
Sumanta Guha