Sciweavers

7289 search results - page 285 / 1458
» A Dependent Set Theory
Sort
View
APAL
2007
78views more  APAL 2007»
15 years 6 months ago
Partial Horn logic and cartesian categories
A logic is developed in which function symbols are allowed to represent partial functions. It has the usual rules of logic (in the form of a sequent calculus) except that the subs...
Erik Palmgren, Steven J. Vickers
151
Voted
VIS
2005
IEEE
146views Visualization» more  VIS 2005»
16 years 8 months ago
View Selection for Volume Rendering
In a visualization of a three-dimensional dataset, the insights gained are dependent on what is occluded and what is not. Suggestion of interesting viewpoints can improve both the...
Udeepta Bordoloi, Han-Wei Shen
ESSLLI
1999
Springer
15 years 11 months ago
Towards Discontinuous Grammar
This paper presents a grammar formalism in which constituent graphs are unions of a continuous surface tree and a discontinuous deep tree. The formalism has an object-oriented desi...
Matthias T. Kromann
CALCO
2009
Springer
139views Mathematics» more  CALCO 2009»
16 years 1 months ago
Traces, Executions and Schedulers, Coalgebraically
A theory of traces of computations has emerged within the field of coalgebra, via finality in Kleisli categories. In concurrency theory, traces are traditionally obtained from ex...
Bart Jacobs, Ana Sokolova
LCN
2006
IEEE
16 years 22 days ago
On Measuring Anonymity For Wireless Mobile Ad-hoc Networks
We propose an evidence theory based anonymity measuring approach for wireless mobile ad-hoc networks. In our approach, an evidence is a measure of the number of detected packets w...
Dijiang Huang