Sciweavers

3265 search results - page 638 / 653
» Representing Groups on Graphs
Sort
View
CPM
2004
Springer
144views Combinatorics» more  CPM 2004»
15 years 9 months ago
A Simple Optimal Representation for Balanced Parentheses
We consider succinct, or highly space-efficient, representations of a (static) string consisting of n pairs of balanced parentheses, that support natural operations such as findi...
Richard F. Geary, Naila Rahman, Rajeev Raman, Venk...
GECCO
2004
Springer
123views Optimization» more  GECCO 2004»
15 years 9 months ago
Heuristic Methods for Solving Euclidean Non-uniform Steiner Tree Problems
In this paper, we consider a variation of the Euclidean Steiner Tree Problem in which the space underlying the set of nodes has a specified non-uniform cost structure. This proble...
Ian Frommer, Bruce L. Golden, Guruprasad Pundoor
RT
2004
Springer
15 years 9 months ago
Bixels: Picture Samples with Sharp Embedded Boundaries
Pixels store a digital image as a grid of point samples that can reconstruct a limited-bandwidth continuous 2-D source image. Although convenient for anti-aliased display, these b...
Jack Tumblin, Prasun Choudhury
TACAS
2004
Springer
122views Algorithms» more  TACAS 2004»
15 years 9 months ago
A Scalable Incomplete Test for the Boundedness of UML RT Models
Abstract. We describe a scalable incomplete boundedness test for the communication buffers in UML RT models. UML RT is a variant of the UML modeling language, tailored to describin...
Stefan Leue, Richard Mayr, Wei Wei
ICDAR
2003
IEEE
15 years 9 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