Sciweavers

414 search results - page 51 / 83
» On discrete norms of polynomials
Sort
View
SIAMNUM
2011
154views more  SIAMNUM 2011»
13 years 4 months ago
Continuous Mesh Framework Part I: Well-Posed Continuous Interpolation Error
In the context of mesh adaptation, Riemannian metric spaces have been used to prescribe orientation, density and stretching of anisotropic meshes. But, such structures are only con...
Adrien Loseille, Frédéric Alauzet
CVPR
2005
IEEE
14 years 12 months ago
Efficient Image Matching with Distributions of Local Invariant Features
Sets of local features that are invariant to common image transformations are an effective representation to use when comparing images; current methods typically judge feature set...
Kristen Grauman, Trevor Darrell
STOC
2004
ACM
126views Algorithms» more  STOC 2004»
14 years 10 months ago
Bypassing the embedding: algorithms for low dimensional metrics
The doubling dimension of a metric is the smallest k such that any ball of radius 2r can be covered using 2k balls of raThis concept for abstract metrics has been proposed as a na...
Kunal Talwar
SODA
2010
ACM
157views Algorithms» more  SODA 2010»
14 years 7 months ago
Testing monotone high-dimensional distributions
A monotone distribution P over a (partially) ordered domain assigns higher probability to y than to x if y x in the order. We study several natural problems concerning testing pr...
Ronitt Rubinfeld, Rocco A. Servedio
SDM
2009
SIAM
140views Data Mining» more  SDM 2009»
14 years 7 months ago
Straightforward Feature Selection for Scalable Latent Semantic Indexing.
Latent Semantic Indexing (LSI) has been validated to be effective on many small scale text collections. However, little evidence has shown its effectiveness on unsampled large sca...
Jun Yan, Shuicheng Yan, Ning Liu, Zheng Chen