Sciweavers

2356 search results - page 376 / 472
» Characterizations of postman sets
Sort
View
ACTA
2008
88views more  ACTA 2008»
15 years 3 months ago
Weighted height of random trees
We consider a model of random trees similar to the split trees of Devroye [30] in which a set of items is recursively partitioned. Our model allows for more flexibility in the cho...
Nicolas Broutin, Luc Devroye, Erin McLeish
CORR
2010
Springer
90views Education» more  CORR 2010»
15 years 3 months ago
Perfect Omniscience, Perfect Secrecy and Steiner Tree Packing
— We consider perfect secret key generation for a “pairwise independent network” model in which every pair of terminals share a random binary string, with the strings shared ...
Sirin Nitinawarat, Prakash Narayan
CORR
2010
Springer
130views Education» more  CORR 2010»
15 years 3 months ago
Fractional Repetition Codes for Repair in Distributed Storage Systems
Abstract—We introduce a new class of exact MinimumBandwidth Regenerating (MBR) codes for distributed storage systems, characterized by a low-complexity uncoded repair process tha...
Salim Y. El Rouayheb, Kannan Ramchandran
ER
2010
Springer
135views Database» more  ER 2010»
15 years 3 months ago
Adaptation in Open Systems: Giving Interaction Its Rightful Place
Abstract. We address the challenge of adaptation in open systems. Open systems are characterized by interactions among autonomous and heterogeneous participants. In such systems, e...
Fabiano Dalpiaz, Amit K. Chopra, Paolo Giorgini, J...
FSS
2008
126views more  FSS 2008»
15 years 3 months ago
Linguistic summarization of time series using a fuzzy quantifier driven aggregation
We propose new types of linguistic summaries of time-series data that extend those proposed in our previous papers. The proposed summaries of time series refer to the summaries of...
Janusz Kacprzyk, Anna Wilbik, Slawomir Zadrozny