Sciweavers

1368 search results - page 229 / 274
» Generalized Rook Polynomials
Sort
View
STOC
2000
ACM
174views Algorithms» more  STOC 2000»
15 years 10 months ago
Noise-tolerant learning, the parity problem, and the statistical query model
We describe a slightly subexponential time algorithm for learning parity functions in the presence of random classification noise, a problem closely related to several cryptograph...
Avrim Blum, Adam Kalai, Hal Wasserman
KDD
2010
ACM
245views Data Mining» more  KDD 2010»
15 years 9 months ago
Flexible constrained spectral clustering
Constrained clustering has been well-studied for algorithms like K-means and hierarchical agglomerative clustering. However, how to encode constraints into spectral clustering rem...
Xiang Wang, Ian Davidson
CORR
2010
Springer
186views Education» more  CORR 2010»
15 years 6 months ago
Capacitated Caching Games
Capacitated Caching (CC) Games are motivated by P2P and web caching applications, and involve nodes on a network making strategic choices regarding the content to replicate in the...
Ragavendran Gopalakrishnan, Dimitrios Kanoulas, Na...
TSP
2008
180views more  TSP 2008»
15 years 5 months ago
Algebraic Signal Processing Theory: Foundation and 1-D Time
This paper introduces a general and axiomatic approach to linear signal processing (SP) that we refer to as the algebraic signal processing theory (ASP). Basic to ASP is the linear...
Markus Püschel, José M. F. Moura
COMPGEOM
2011
ACM
14 years 9 months ago
Comparing distributions and shapes using the kernel distance
Starting with a similarity function between objects, it is possible to define a distance metric (the kernel distance) on pairs of objects, and more generally on probability distr...
Sarang C. Joshi, Raj Varma Kommaraju, Jeff M. Phil...