Sciweavers

52 search results - page 6 / 11
» Effective Dispersion in Computable Metric Spaces
Sort
View
DAC
2004
ACM
14 years 10 months ago
Retargetable profiling for rapid, early system-level design space exploration
Fast and accurate estimation is critical for exploration of any dece in general. As we move to higher levels of abstraction, on of complete system designs at each level of abstrac...
Lukai Cai, Andreas Gerstlauer, Daniel Gajski
DEBS
2010
ACM
14 years 1 months ago
Magnet: practical subscription clustering for Internet-scale publish/subscribe
An effective means for building Internet-scale distributed applications, and in particular those involving group-based information sharing, is to deploy peer-to-peer overlay netwo...
Sarunas Girdzijauskas, Gregory Chockler, Ymir Vigf...
ICPR
2006
IEEE
14 years 3 months ago
Face Recognition Using Angular LDA and SVM Ensembles
One successful approach to feature extraction in face recognition problems is that of linear discriminant analysis (LDA). We examine an extension of this technique, called angular...
Raymond S. Smith, Josef Kittler, Miroslav Hamouz, ...
EDBT
2010
ACM
185views Database» more  EDBT 2010»
13 years 11 months ago
Probabilistic threshold k nearest neighbor queries over moving objects in symbolic indoor space
The availability of indoor positioning renders it possible to deploy location-based services in indoor spaces. Many such services will benefit from the efficient support for k n...
Bin Yang 0002, Hua Lu, Christian S. Jensen
ICCV
2009
IEEE
1556views Computer Vision» more  ICCV 2009»
15 years 2 months ago
Kernel Methods for Weakly Supervised Mean Shift Clustering
Mean shift clustering is a powerful unsupervised data analysis technique which does not require prior knowledge of the number of clusters, and does not constrain the shape of th...
Oncel Tuzel, Fatih Porikli, Peter Meer