501 search results - page 100 / 101 » Rough Sets and Approximation Schemes |
DATAMINE
2006
13 years 7 months ago
2006
Clustering methods for data-mining problems must be extremely scalable. In addition, several data mining applications demand that the clusters obtained be balanced, i.e., be of ap...
PAMI
2006
13 years 7 months ago
2006
In this paper, we propose two novel methods for face recognition under arbitrary unknown lighting by using spherical harmonics illumination representation, which require only one t...
MEDIAFORENSICS
2010
13 years 5 months ago
2010
One of the critical steps in designing a secure biometric system is protecting the templates of the users that are stored either in a central database or on smart cards. If a biom...
TWC
2010
13 years 2 months ago
2010
Optimized opportunistic multicast scheduling (OMS) is studied for cellular networks, where the problem of efficiently transmitting a common set of fountain-encoded data from a sin...
AAAI
2011
12 years 7 months ago
2011
Externalities are recognized to exist in the sponsored search market, where two co-located ads compete for user attention. Existing work focuses on the effect of another ad on th...