908 search results - page 156 / 182 » Temporal Analysis of Time Bounded Digital Systems |
COMPGEOM
2010
ACM
14 years 24 days ago
2010
ACM
We present a simple randomized scheme for triangulating a set P of n points in the plane, and construct a kinetic data structure which maintains the triangulation as the points of...
SIGMOD
2010
ACM
14 years 16 days ago
2010
ACM
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...
STOC
1993
ACM
13 years 11 months ago
1993
ACM
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...
SPAA
2010
ACM
13 years 8 months ago
2010
ACM
We study the communication complexity of rumor spreading in the random phone-call model. Suppose n players communicate in parallel rounds, where in each round every player calls a...
GIS
2007
ACM
14 years 8 months ago
2007
ACM
Many Geographic Information System (GIS) applications must handle large geospatial datasets stored in raster representation. Spatial joins over raster data are important queries i...