Sciweavers

2434 search results - page 39 / 487
» Algorithmic Randomness of Closed Sets
Sort
View
COLT
2005
Springer
15 years 7 months ago
Towards a Theoretical Foundation for Laplacian-Based Manifold Methods
In recent years manifold methods have attracted a considerable amount of attention in machine learning. However most algorithms in that class may be termed ā€œmanifold-motivatedā€...
Mikhail Belkin, Partha Niyogi
COMPGEOM
2008
ACM
15 years 3 months ago
Embedding and similarity search for point sets under translation
Pattern matching in point sets is a well studied problem with numerous applications. We assume that the point sets may contain outliers (missing or spurious points) and are subjec...
Minkyoung Cho, David M. Mount
STOC
2007
ACM
142views Algorithms» more  STOC 2007»
16 years 2 months ago
Lower bounds for randomized read/write stream algorithms
Motivated by the capabilities of modern storage architectures, we consider the following generalization of the data stream model where the algorithm has sequential access to multi...
Paul Beame, T. S. Jayram, Atri Rudra
CSREASAM
2003
15 years 3 months ago
Randomized Traitor Tracing Algorithms for Broadcast Security
We introduce and analyze a randomized traitor tracing algorithm for broadcast security. This algorithm is very efficient compared to brute force methods (the mean time it takes is...
Simon McNicol, Serdar Boztas
SIGMOD
2002
ACM
132views Database» more  SIGMOD 2002»
16 years 2 months ago
Clustering by pattern similarity in large data sets
Clustering is the process of grouping a set of objects into classes of similar objects. Although definitions of similarity vary from one clustering model to another, in most of th...
Haixun Wang, Wei Wang 0010, Jiong Yang, Philip S. ...