815 search results - page 84 / 163 » Approximate Entropy Reducts |
VC
2008
14 years 11 months ago
2008
Abstract We present an efficient method for importance sampling the product of multiple functions. Our algorithm computes a quick approximation of the product on-the-fly, based on ...
112
click to vote
CLEF
2011
Springer
13 years 11 months ago
2011
Springer
Plagiarism detection has been considered as a classification problem which can be approximated with intrinsic strategies, considering self-based information from a given document,...
KDD
2006
ACM
16 years 9 days ago
2006
ACM
Several algorithms have been proposed to learn to rank entities modeled as feature vectors, based on relevance feedback. However, these algorithms do not model network connections...
110
click to vote
CORR
2010
Springer
14 years 6 months ago
2010
Springer
We consider a finite-state memoryless channel with i.i.d. channel state and the input Markov process supported on a mixing finite-type constraint. We discuss the asymptotic behavio...
ISPD
2000
ACM
15 years 4 months ago
2000
ACM
As technology advances, more and more issues need to be considered in the placement stage, e.g., wirelength, congestion, timing, coupling. It is very hard to consider all of them ...