Sciweavers

35 search results - page 2 / 7
» Succinct Representations of Dynamic Strings
Sort
View
AGI
2011
12 years 8 months ago
An Information Theoretic Representation of Agent Dynamics as Set Intersections
We represent agents as sets of strings. Each string encodes a potential interaction with another agent or environment. We represent the total set of dynamics between two agents as ...
Samuel Epstein, Margrit Betke
SODA
2010
ACM
200views Algorithms» more  SODA 2010»
14 years 2 months ago
Fully-Functional Succinct Trees
We propose new succinct representations of ordinal trees, which have been studied extensively. It is known that any n-node static tree can be represented in 2n + o(n) bits and a l...
Kunihiko Sadakane, Gonzalo Navarro
CPM
1997
Springer
87views Combinatorics» more  CPM 1997»
13 years 9 months ago
An Improved Pattern Matching Algorithm for Strings in Terms of Straight-Line Programs
We show an ecient pattern matching algorithm for strings that are succinctly described in terms of straight-line programs, in which the constants are symbols and the only operati...
Masamichi Miyazaki, Ayumi Shinohara, Masayuki Take...
CORR
2010
Springer
137views Education» more  CORR 2010»
13 years 4 months ago
Open Graphs and Monoidal Theories
String diagrams are a powerful tool for reasoning about physical processes, logic circuits, tensor networks, and many other compositional structures. The distinguishing feature of...
Lucas Dixon, Aleks Kissinger
CVPR
2004
IEEE
14 years 6 months ago
Elastic-String Models for Representation and Analysis of Planar Shapes
We develop a new framework for the quantitative analysis of shapes of planar curves. Shapes are modeled on elastic strings that can be bent, stretched or compressed at different r...
Washington Mio, Anuj Srivastava