Sciweavers

1446 search results - page 253 / 290
» Testing for Concise Representations
Sort
View
BIRTHDAY
2004
Springer
14 years 1 months ago
Pure Type Systems in Rewriting Logic: Specifying Typed Higher-Order Languages in a First-Order Logical Framework
Abstract. The logical and operational aspects of rewriting logic as a logical framework are tested and illustrated in detail by representing pure type systems as object logics. Mor...
Mark-Oliver Stehr, José Meseguer
KR
2004
Springer
14 years 1 months ago
On Eliminating Disjunctions in Stable Logic Programming
Disjunction is generally considered to add expressive power to logic programs under the stable model semantics, which have become a popular programming paradigm for knowledge repr...
Thomas Eiter, Michael Fink, Hans Tompits, Stefan W...
ICDAR
2003
IEEE
14 years 1 months ago
A Constraint-based Approach to Table Structure Derivation
er presents an approach to deriving an abstract geometric model of a table from a physical representation. The technique developed uses a graph of constraints between cells which ...
Matthew Hurst
SIGGRAPH
1998
ACM
13 years 12 months ago
Progressive Forest Split Compression
In this paper we introduce the Progressive Forest Split (PFS) representation, a new adaptive refinement scheme for storing and transmitting manifold triangular meshes in progress...
Gabriel Taubin, André Guéziec, Willi...
PG
1997
IEEE
13 years 12 months ago
Rendering of spherical light fields
A plenoptic function is a parameterized function describing the flow of light in space, and has served as a key idea in building some of the recent image-based rendering systems....
Insung Ihm, Sanghoon Park, Rae Kyoung Lee