Sciweavers

4767 search results - page 608 / 954
» Structures for Abstract Rewriting
Sort
View
151
Voted
ACTA
2008
82views more  ACTA 2008»
15 years 6 months ago
Two-tier relaxed heaps
Abstract. We introduce an adaptation of run-relaxed heaps which provides efficient heap operations with respect to the number of element comparisons performed. Our data structure g...
Amr Elmasry, Claus Jensen, Jyrki Katajainen
150
Voted
ANOR
2008
69views more  ANOR 2008»
15 years 6 months ago
NP-hardness results for the aggregation of linear orders into median orders
Abstract Given a collection of individual preferences defined on a same finite set of candidates, we consider the problem of aggregating them into a collective preference minimizin...
Olivier Hudry
CORR
2010
Springer
122views Education» more  CORR 2010»
15 years 6 months ago
Specifying Reusable Components
Reusable software components need well-defined interfaces, rigorously and completely documented features, and a design amenable both to reuse and to formal verification; all these...
Nadia Polikarpova, Carlo A. Furia, Bertrand Meyer
CORR
2010
Springer
124views Education» more  CORR 2010»
15 years 6 months ago
Component Evolution in General Random Intersection Graphs
Abstract. Random intersection graphs (RIGs) are an important random structure with algorithmic applications in social networks, epidemic networks, blog readership, and wireless sen...
Milan Bradonjic, Aric A. Hagberg, Nicolas W. Henga...
CORR
2010
Springer
142views Education» more  CORR 2010»
15 years 6 months ago
Two-dimensional ranking of Wikipedia articles
Abstract. The Library of Babel, described by Jorge Luis Borges, stores an enormous amount of information. The Library exists ab aeterno. Wikipedia, a free online encyclopaedia, bec...
A. O. Zhirov, O. V. Zhirov, D. L. Shepelyansky