855 search results - page 101 / 171 » Complexity of Equations over Sets of Natural Numbers |
KDD
2006
ACM
15 years 10 months ago
2006
ACM
We introduce a novel framework (BLOSOM) for mining (frequent) boolean expressions over binary-valued datasets. We organize the space of boolean expressions into four categories: p...
IDA
2005
Springer
15 years 3 months ago
2005
Springer
We consider the problem of learning a ranking function, that is a mapping from instances to rankings over a finite number of labels. Our learning method, referred to as ranking by...
PVLDB
2008
14 years 9 months ago
2008
Unlike traditional database queries, keyword queries do not adhere to predefined syntax and are often dirty with irrelevant words from natural languages. This makes accurate and e...
JMLR
2012
13 years 11 days ago
2012
Grid search and manual search are the most widely used strategies for hyper-parameter optimization. This paper shows empirically and theoretically that randomly chosen trials are ...
IJNSEC
2008
14 years 10 months ago
2008
The nature of the RSA public modulus N as a composite of at least two secret large primes was always considered as a major obstacle facing the RSA function sharing without the hel...