Results 11  20
of
6,916
Compact Representations and Approximations for Compuation in Games
, 2008
"... Compact representations have recently been developed as a way of both encoding the strategic interactions of a game in an intuitive way. They are also useful in speeding up the computation of important solution concepts such as Nash Equiliria, because they can often be represented in a size that is ..."
Abstract
 Add to MetaCart
Compact representations have recently been developed as a way of both encoding the strategic interactions of a game in an intuitive way. They are also useful in speeding up the computation of important solution concepts such as Nash Equiliria, because they can often be represented in a size
Compact Representations of Extended Causal Models
, 2012
"... Judea Pearl (2000) was the first to propose a definition of actual causation using causal models. A number of authors have suggested that an adequate account of actual causation must appeal not only to causal structure, but also to considerations of normality. In (Halpern & Hitchcock, 2011), we ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
offer a definition of actual causation using extended causal models, which include information about both causal structure and normality. Extended causal models are potentially very complex. In this paper, we show how it is possible to achieve a compact representation of extended causal models. 1
Bonsai: A Compact Representation of Trees
, 1993
"... This paper shows how trees can be stored in a very compact form, called `Bonsai', using hash tables. A method is described that is suitable for large trees that grow monotonically within a predefined maximum size limit. Using it, pointers in any tree can be represented within 6 +log 2 n bits pe ..."
Abstract

Cited by 13 (0 self)
 Add to MetaCart
per node where n is the maximum number of children a node can have. We first describe a general way of storing trees in hash tables, and then introduce the idea of compact hashing which underlies the Bonsai structure. These two techniques are combined to give a compact representation of trees, and a
On compact representation and robustness of transfer patterns . . .
, 2013
"... Transfer pattern routing is a stateoftheart routing algorithm for public transportation. It allows to answer multicriteria shortest path queries within a few milliseconds. The algorithm is based on an expensive precomputation of shortest paths between stations. This thesis examines two aspects ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
aspects of transfer pattern routing. The first objective is to find a compact representation of the transfer patterns. We detect redundancy in the transfer patterns and present novel ways to store the information within less memory. The second objective is to analyze the robustness of the transfer
Compact Representation of Bidirectional Texture Functions
"... A bidirectional texture function (BTF) describes image texture as it varies with viewing and illumination direction. Many real world surfaces such as skin, fur, gravel, etc. exhibit finescale geometric surface detail. Accordingly, variations in appearance with viewing and illumination direction may ..."
Abstract
 Add to MetaCart
evaluation of importance of individual images in the overall representation. The result is a compact representation and a recognition method where a single novel image of unknown viewing and illumination direction can be classified efficiently. The CUReT (ColumbiaUtrecht reflectance and texture) database
Compact Representations By FiniteState Transducers
 In 32 nd Meeting of the Association for Computational Linguistics (ACL 94), Proceedings of the Conference, Las Cruces
, 1994
"... Finitestate transducers give efficient representations of many Natural Language phenomena. They allow to account for complex lexicon restrictions encountered, without involving the use of a large set of complex rules difficult to analyze. We here show that these representations can be made very com ..."
Abstract

Cited by 14 (6 self)
 Add to MetaCart
Finitestate transducers give efficient representations of many Natural Language phenomena. They allow to account for complex lexicon restrictions encountered, without involving the use of a large set of complex rules difficult to analyze. We here show that these representations can be made very
SOT: Compact representation for tetrahedral meshes
"... The Corner Table (CT) promoted by Rossignac et al. provides a simple and efficient representation of triangle meshes, storing 6 integer references per triangle (3 vertex references in the V table and 3 references to opposite corners in the O table that accelerate access to adjacent triangles). The C ..."
Abstract

Cited by 12 (4 self)
 Add to MetaCart
The Corner Table (CT) promoted by Rossignac et al. provides a simple and efficient representation of triangle meshes, storing 6 integer references per triangle (3 vertex references in the V table and 3 references to opposite corners in the O table that accelerate access to adjacent triangles
SQuad: Compact representation for triangle meshes
 Computer Graphics Forum
, 2011
"... The SQuad data structure represents the connectivity of a triangle mesh by its “S table ” of about 2 rpt (integer references per triangle). Yet it allows for a simple implementation of expected constanttime, randomaccess operators for traversing the mesh, including inorder traversal of the triang ..."
Abstract

Cited by 9 (4 self)
 Add to MetaCart
of the triangles incident upon a vertex. SQuad is more compact than the Corner Table (CT), which stores 6 rpt, and than the recently proposed SOT, which stores 3 rpt. However, incore access is generally faster in CT than in SQuad, and SQuad requires rebuilding the S table if the connectivity is altered
Compact Representation of Knowledge Bases in ILP
 In Proceedings of the 12th International Conference on Inductive Logic Programming, volume 2583 of Lecture Notes in Artificial Intelligence
, 2002
"... Many inductive systems, including ILP systems, learn from a knowledge base that is structured around examples. In practical situations this examplecentered representation can cause a lot of redundancy. ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
Many inductive systems, including ILP systems, learn from a knowledge base that is structured around examples. In practical situations this examplecentered representation can cause a lot of redundancy.
Compact Representations of Revision of Horn Clauses
 Proceedings of the Eighth Australian Joint Artificial Intelligence Conference (AI95
, 1995
"... Several methods have been proposed, in the past years, as an attempt to define how to deal with a dynamicallychanging scenario. From a computational point of view, different definitions lead to different computational properties, namely to a complexity between \Delta p 2 and \Delta p 3 in the p ..."
Abstract

Cited by 7 (6 self)
 Add to MetaCart
in the polynomial hierarchy. When we restrict the analysis to cases where some operations become tractable (Horn formulas), other problems arise. We show that, providing some assumption on the polynomial hierarchy, many update operators are uncompactable, i.e. it is impossible to find a representation of the result
Results 11  20
of
6,916