2583 search results - page 169 / 517 » On the Representation of Timed Polyhedra |
149
click to vote
CNL
2009
15 years 7 months ago
2009
This paper presents a general framework called ontographs that relies on a graphical notation and enables the tool-independent and reliable evaluation of human understandability of...
141
click to vote
IPL
2008
15 years 6 months ago
2008
Quasi-reversible automata is a suitable representation for reversible languages. In this work a method is proposed to obtain such an automaton for any given reversible language re...
171
click to vote
CORR
2012
Springer
14 years 2 months ago
2012
Springer
We show how to compute cartograms with worst-case optimal polygonal complexity. Specifically we study rectilinear duals which are side-contact representations of a planar graph G ...
167
click to vote
SSD
2009
Springer
15 years 11 months ago
2009
Springer
We introduce TOQL, a query language for querying time information in ontologies. TOQL is a high level query language that handles ontologies almost like relational databases. Queri...
157
click to vote
ICMCS
2010
IEEE
15 years 7 months ago
2010
IEEE
Though the variety of desktop real time stereo vision systems has grown considerably in the past several years, few make any verifiable claims about the accuracy of the algorithms...