Sciweavers

1157 search results - page 66 / 232
» Descriptive Complexity and Model Checking
Sort
View
SMA
2003
ACM
163views Solid Modeling» more  SMA 2003»
14 years 4 months ago
Fast swept volume approximation of complex polyhedral models
We present an efficient algorithm to approximate the swept volume (SV) of a complex polyhedron along a given trajectory. Given the boundary description of the polyhedron and a pat...
Young J. Kim, Gokul Varadhan, Ming C. Lin, Dinesh ...
NGITS
1999
Springer
14 years 3 months ago
From Object-Process Diagrams to a Natural Object-Process Language
As the requirements for system analysis and design become more complex, the need for a natural, yet formal way of specifying system analysis findings and design decisions are becom...
Mor Peleg, Dov Dori
AADEBUG
2005
Springer
14 years 4 months ago
Specifying and checking component usage
One of today’s challenges is producing reliable software in the face of an increasing number of interacting components. Our system CHET lets developers define specifications des...
Steven P. Reiss
MMM
2006
Springer
130views Multimedia» more  MMM 2006»
14 years 5 months ago
Detailed audiovisual profile: enabling interoperability between MPEG-7 based systems
MPEG-7 is an excellent choice for the description of audiovisual content due to its flexibility and comprehensiveness. The drawback is that these properties also increase the comp...
Werner Bailer, Peter Schallauer
DAC
2012
ACM
12 years 1 months ago
Equivalence checking for behaviorally synthesized pipelines
Loop pipelining is a critical transformation in behavioral synthesis. It is crucial to producing hardware designs with acceptable latency and throughput. However, it is a complex ...
Kecheng Hao, Sandip Ray, Fei Xie