Sciweavers

29908 search results - page 120 / 5982
» On the Complexity of
Sort
View
BMVC
2010
13 years 8 months ago
Multiscale Keypoint Analysis based on Complex Wavelets
We describe a new multiscale keypoint detector and a set of local visual descriptors, both based on the efficient Dual-Tree Complex Wavelet Transform. The detector has properties ...
Pashmina Bendale, Bill Triggs, Nick G. Kingsbury
DCG
2010
104views more  DCG 2010»
13 years 7 months ago
Vietoris-Rips Complexes of Planar Point Sets
Fix a finite set of points in Euclidean n-space En , thought of as a point-cloud sampling of a certain domain D En . The VietorisRips complex is a combinatorial simplicial complex...
Erin W. Chambers, Vin de Silva, Jeff Erickson, Rob...
ECCC
2011
202views ECommerce» more  ECCC 2011»
13 years 5 months ago
New strong direct product results in communication complexity
We show two new direct product results in two different models of communication complexity. Our first result is in the model of one-way public-coin model. Let f ⊆ X × Y × Z ...
Rahul Jain
CORR
2010
Springer
115views Education» more  CORR 2010»
13 years 5 months ago
A strong direct product theorem for two-way public coin communication complexity
We show a direct product result for two-way public coin communication complexity of all relations in terms of a new complexity measure that we define. Our new measure is a general...
Rahul Jain
JMLR
2010
143views more  JMLR 2010»
13 years 5 months ago
Rademacher Complexities and Bounding the Excess Risk in Active Learning
Sequential algorithms of active learning based on the estimation of the level sets of the empirical risk are discussed in the paper. Localized Rademacher complexities are used in ...
Vladimir Koltchinskii