815 search results - page 124 / 163 » Approximate Entropy Reducts |
SIGECOM
2010
ACM
15 years 4 months ago
2010
ACM
This paper studies —from the perspective of efficient computation— a type of competition that is widespread throughout the plant and animal kingdoms, higher education, politic...
117
click to vote
JCSS
2008
14 years 11 months ago
2008
We use techniques from sample-complexity in machine learning to reduce problems of incentive-compatible mechanism design to standard algorithmic questions, for a broad class of re...
111
click to vote
CORR
2012
Springer
13 years 7 months ago
2012
Springer
In many information networks, data items – such as updates in social networks, news flowing through interconnected RSS feeds and blogs, measurements in sensor networks, route u...
CVPR
2007
IEEE
16 years 1 months ago
2007
IEEE
The success of tensor-based subspace learning depends heavily on reducing correlations along the column vectors of the mode-k flattened matrix. In this work, we study the problem ...
ECCV
2008
Springer
16 years 1 months ago
2008
Springer
This paper presents an approach to shadow removal that preserves texture consistency between the original shadow and lit area. Illumination reduction in the shadow area not only da...