Sciweavers

50 search results - page 2 / 10
» Universal Succinct Representations of Trees
Sort
View
ALENEX
2010
163views Algorithms» more  ALENEX 2010»
13 years 6 months ago
Succinct Trees in Practice
We implement and compare the major current techniques for representing general trees in succinct form. This is important because a general tree of n nodes is usually represented i...
Diego Arroyuelo, Rodrigo Cánovas, Gonzalo N...
CPM
2004
Springer
144views Combinatorics» more  CPM 2004»
13 years 10 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...
TACAS
2004
Springer
108views Algorithms» more  TACAS 2004»
13 years 10 months ago
The Succinct Solver Suite
Abstract. The Succinct Solver Suite offers two analysis engines for solving data and control flow problems expressed in clausal form in a large fragment of first order logic. Th...
Flemming Nielson, Hanne Riis Nielson, Hongyan Sun,...
AAAI
2007
13 years 7 months ago
Learning Voting Trees
Binary voting trees provide a succinct representation for a large and prominent class of voting rules. In this paper, we investigate the PAC-learnability of this class of rules. W...
Ariel D. Procaccia, Aviv Zohar, Yoni Peleg, Jeffre...
CN
2004
114views more  CN 2004»
13 years 5 months ago
Representing the Internet as a succinct forest
Effective placement of resources used to support distributed services in the Internet depends on an accurate representation of Internet topology and routing. Representations of au...
Jim Gast, Paul Barford