Sciweavers

419 search results - page 18 / 84
» Succincter
Sort
View
COCOON
2008
Springer
14 years 11 months ago
On the Complexity of Equilibria Problems in Angel-Daemon Games
We analyze the complexity of equilibria problems for a class of strategic zero-sum games, called Angel-Daemon games. Those games were introduced to asses the goodness of a web or g...
Joaquim Gabarró, Alina García, Maria...
CORR
2010
Springer
120views Education» more  CORR 2010»
14 years 4 months ago
LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations
LRM-Trees are an elegant way to partition a sequence of values into sorted consecutive blocks, and to express the relative position of the first element of each block within a prev...
Jérémy Barbay, Johannes Fischer
IJFCS
2006
83views more  IJFCS 2006»
14 years 9 months ago
A Simple Alphabet-independent Fm-index
Abstract. We design a succinct full-text index based on the idea of Huffmancompressing the text and then applying the Burrows-Wheeler transform over it. The resulting structure can...
Szymon Grabowski, Gonzalo Navarro, Rafal Przywarsk...
70
Voted
SODA
2010
ACM
238views Algorithms» more  SODA 2010»
15 years 6 months ago
How good is the Chord algorithm?
The Chord algorithm is a popular, simple method for the succinct approximation of curves, which is widely used, under different names, in a variety of areas, such as, multiobjecti...
Constantinos Daskalakis, Ilias Diakonikolas, Mihal...
AAAI
2007
14 years 11 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...