Sciweavers

71 search results - page 9 / 15
» Optimal Distance Bounds on Time-Series Data.
Sort
View
APPROX
2008
Springer
71views Algorithms» more  APPROX 2008»
14 years 11 months ago
Tight Bounds for Hashing Block Sources
It is known that if a 2-universal hash function H is applied to elements of a block source (X1, . . . , XT ), where each item Xi has enough min-entropy conditioned on the previous...
Kai-Min Chung, Salil P. Vadhan
CORR
2011
Springer
142views Education» more  CORR 2011»
14 years 1 months ago
On the Locality of Codeword Symbols
Consider a linear [n, k, d]q code C. We say that that i-th coordinate of C has locality r, if the value at this coordinate can be recovered from accessing some other r coordinates...
Parikshit Gopalan, Cheng Huang, Huseyin Simitci, S...
FOCS
2008
IEEE
14 years 10 months ago
Hardness of Nearest Neighbor under L-infinity
Recent years have seen a significant increase in our understanding of high-dimensional nearest neighbor search (NNS) for distances like the 1 and 2 norms. By contrast, our underst...
Alexandr Andoni, Dorian Croitoru, Mihai Patrascu
CSDA
2006
67views more  CSDA 2006»
14 years 9 months ago
Sensitivity analysis of the strain criterion for multidimensional scaling
Multidimensional scaling (MDS) is a collection of data analytic techniques for constructing configurations of points from dissimilarity information about interpoint distances. Cla...
R. M. Lewis, M. W. Trosset
WSDM
2012
ACM
301views Data Mining» more  WSDM 2012»
13 years 5 months ago
Learning evolving and emerging topics in social media: a dynamic nmf approach with temporal regularization
As massive repositories of real-time human commentary, social media platforms have arguably evolved far beyond passive facilitation of online social interactions. Rapid analysis o...
Ankan Saha, Vikas Sindhwani