Sciweavers

5169 search results - page 215 / 1034
» Locality approximation using time
Sort
View
TKDE
2008
171views more  TKDE 2008»
15 years 6 months ago
Efficient Similarity Search in Nonmetric Spaces with Local Constant Embedding
Similarity-based search has been a key factor for many applications such as multimedia retrieval, data mining, Web search and retrieval, and so on. There are two important issues r...
Lei Chen 0002, Xiang Lian
SPLC
2008
15 years 7 months ago
Filtered Cartesian Flattening: An Approximation Technique for Optimally Selecting Features while Adhering to Resource Constraint
Software Product-lines (SPLs) use modular software components that can be reconfigured into different variants for different requirements sets. Feature modeling is a common method...
Jules White, B. Doughtery, Douglas C. Schmidt
CORR
2010
Springer
142views Education» more  CORR 2010»
15 years 4 months ago
HyperANF: Approximating the Neighbourhood Function of Very Large Graphs on a Budget
The neighbourhood function NG(t) of a graph G gives, for each t ∈ N, the number of pairs of nodes x, y such that y is reachable from x in less that t hops. The neighbourhood fun...
Paolo Boldi, Marco Rosa, Sebastiano Vigna
CVPR
2008
IEEE
16 years 8 months ago
In defense of Nearest-Neighbor based image classification
State-of-the-art image classification methods require an intensive learning/training stage (using SVM, Boosting, etc.) In contrast, non-parametric Nearest-Neighbor (NN) based imag...
Oren Boiman, Eli Shechtman, Michal Irani
COMPGEOM
2009
ACM
16 years 26 days ago
A general approach for cache-oblivious range reporting and approximate range counting
We present cache-oblivious solutions to two important variants of range searching: range reporting and approximate range counting. Our main contribution is a general approach for ...
Peyman Afshani, Chris H. Hamilton, Norbert Zeh