Sciweavers

5350 search results - page 147 / 1070
» Space and time in eco-ontologies
Sort
View
DM
2007
97views more  DM 2007»
15 years 6 months ago
Recognizing Cartesian products in linear time
We present an algorithm that determines the prime factors of connected graphs with respect to the Cartesian product in linear time and space. This improves a result of Aurenhammee...
Wilfried Imrich, Iztok Peterin
CCCG
2010
15 years 8 months ago
Computing the straight skeleton of a monotone polygon in O(n log n) time
The straight skeleton of a simple polygon is defined as the trace of the vertices when the initial polygon is shrunken in self-parallel manner [2]. In this paper, we propose a sim...
Gautam K. Das, Asish Mukhopadhyay, Subhas C. Nandy...
CCCG
2006
15 years 7 months ago
Optimal Polygon Placement
Given a simple polygon P with m vertices and a set S of n points in the plane, we consider the problem of finding a rigid motion placement of P that contains the maximum number of...
Prosenjit Bose, Jason Morrison
COMCOM
1998
117views more  COMCOM 1998»
15 years 6 months ago
Specification, validation, and verification of time-critical systems
In this paper, we propose a new formalism, named the Timed Communicating Finite State Machine (Timed CFSM), for specifying and verifying time-critical systems. Timed CFSM preserve...
Shiuh-Pyng Shieh, Jun-Nan Chen
VLDB
1994
ACM
91views Database» more  VLDB 1994»
15 years 10 months ago
On Spatially Partitioned Temporal Join
This paper presents an innovative partitionbased time join strategy for temporal databases where time is represented by time intervals. The proposed method maps time intervals to ...
Hongjun Lu, Beng Chin Ooi, Kian-Lee Tan