Sciweavers

5236 search results - page 950 / 1048
» Similarity Measurement in Context
Sort
View
ECCC
2010
122views more  ECCC 2010»
15 years 4 months ago
Query Complexity Lower Bounds for Reconstruction of Codes
We investigate the problem of local reconstruction, as defined by Saks and Seshadhri (2008), in the context of error correcting codes. The first problem we address is that of me...
Sourav Chakraborty, Eldar Fischer, Arie Matsliah
SIAMCOMP
2010
94views more  SIAMCOMP 2010»
15 years 4 months ago
Local Monotonicity Reconstruction
We propose a general model of local property reconstruction. Suppose we have a function f on domain Γ, which is supposed to have a particular property P, but may not have the pro...
Michael E. Saks, C. Seshadhri
OPODIS
2010
15 years 4 months ago
Biased Selection for Building Small-World Networks
Abstract. Small-world networks are currently present in many distributed applications and can be built augmenting a base network with long-range links using a probability distribut...
Andrés Sevilla, Alberto Mozo, M. Araceli Lo...
EDM
2009
116views Data Mining» more  EDM 2009»
15 years 4 months ago
Determining the Significance of Item Order In Randomized Problem Sets
Researchers who make tutoring systems would like to know which sequences of educational content lead to the most effective learning by their students. The majority of data collecte...
Zachary A. Pardos, Neil T. Heffernan
FAST
2009
15 years 4 months ago
Tiered Fault Tolerance for Long-Term Integrity
Fault-tolerant services typically make assumptions about the type and maximum number of faults that they can tolerate while providing their correctness guarantees; when such a fau...
Byung-Gon Chun, Petros Maniatis, Scott Shenker, Jo...