Sciweavers

7820 search results - page 286 / 1564
» Formalization of Time and Space
Sort
View
DM
2007
97views more  DM 2007»
15 years 7 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 8 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
DATE
2008
IEEE
68views Hardware» more  DATE 2008»
16 years 1 months ago
Automatic Generation of Complex Properties for Hardware Designs
Property checking is a promising approach to prove the correctness of today’s complex designs. However, in practice this requires the formulation of formal properties which is a...
Frank Rogin, Thomas Klotz, Görschwin Fey, Rol...
FDL
2003
IEEE
16 years 21 days ago
Using Symbolic Simulation for Bounded Property Checking
Assuring correctness of digital designs is one of the major tasks in the system design flow. Formal methods have been proposed to accompany commonly used simulation approaches. I...
Jürgen Ruf, Prakash Mohan Peranandam, Thomas ...