Sciweavers

1099 search results - page 94 / 220
» Least-Squares Independence Test
Sort
View
CVPR
2012
IEEE
13 years 1 months ago
Icon scanning: Towards next generation QR codes
Undoubtedly, a key feature in the popularity of smartmobile devices is the numerous applications one can install. Frequently, we learn about an application we desire by seeing it ...
Itamar Friedman, Lihi Zelnik-Manor
DIS
2007
Springer
15 years 5 months ago
A Hilbert Space Embedding for Distributions
We describe a technique for comparing distributions without the need for density estimation as an intermediate step. Our approach relies on mapping the distributions into a reprodu...
Alexander J. Smola, Arthur Gretton, Le Song, Bernh...
SODA
2004
ACM
121views Algorithms» more  SODA 2004»
15 years 10 days ago
A characterization of easily testable induced subgraphs
Let H be a fixed graph on h vertices. We say that a graph G is induced H-free if it does not contain any induced copy of H. Let G be a graph on n vertices and suppose that at leas...
Noga Alon, Asaf Shapira
STOC
2005
ACM
96views Algorithms» more  STOC 2005»
15 years 11 months ago
Every monotone graph property is testable
A graph property is called monotone if it is closed under taking (not necessarily induced) subgraphs (or, equivalently, if it is closed under removal of edges and vertices). Many ...
Noga Alon, Asaf Shapira
AI
2005
Springer
15 years 4 months ago
Instance Cloning Local Naive Bayes
The instance-based k-nearest neighbor algorithm (KNN)[1] is an effective classification model. Its classification is simply based on a vote within the neighborhood, consisting o...
Liangxiao Jiang, Harry Zhang, Jiang Su