Sciweavers

1227 search results - page 128 / 246
» Approximate Kernel Clustering
Sort
View
CVPR
2004
IEEE
16 years 15 hour ago
Shaping Receptive Fields for Affine Invariance
The Gaussian kernel has played a central role in multi-scale methods for feature extraction and matching. In this paper, a method for shaping the filter using the local image stru...
S. Ravela
ICIP
2007
IEEE
15 years 4 months ago
Adaptive Cluster-Distance Bounding for Nearest Neighbor Search in Image Databases
We consider approaches for exact similarity search in a high dimensional space of correlated features representing image datasets, based on principles of clustering and vector qua...
Sharadh Ramaswamy, Kenneth Rose
MLDM
1999
Springer
15 years 2 months ago
Non-hierarchical Clustering with Rival Penalized Competitive Learning for Information Retrieval
In large content-based image database applications, e cient information retrieval depends heavily on good indexing structures of the extracted features. While indexing techniques f...
Irwin King, Tak-Kan Lau
ADHOC
2005
122views more  ADHOC 2005»
14 years 10 months ago
Maintaining weakly-connected dominating sets for clustering ad hoc networks
An ad hoc network is a multihop wireless communication network supporting mobile users. Network performance degradation is a major problem as the network becomes larger. Clusterin...
Yuanzhu Peter Chen, Arthur L. Liestman
STOC
2007
ACM
146views Algorithms» more  STOC 2007»
15 years 10 months ago
Playing games with approximation algorithms
In an online linear optimization problem, on each period t, an online algorithm chooses st S from a fixed (possibly infinite) set S of feasible decisions. Nature (who may be adve...
Sham M. Kakade, Adam Tauman Kalai, Katrina Ligett