1918 search results - page 91 / 384 » Discovering Cortical Algorithms |
STACS
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. Suppose one has access to oracles generating samples from two unknown probability distributions p and q on some N-element set. How many samples does one need to test whet...
APWEB
2005
Springer
15 years 3 months ago
2005
Springer
Itemset share has been proposed as a measure of the importance of itemsets for mining association rules. The value of the itemset share can provide useful information such as total...
PVM
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. To practically solve NP-hard combinatorial optimization problems, local search algorithms and their parallel implementations on PVM or MPI have been frequently discussed....
108
click to vote
ICDM
2002
IEEE
15 years 2 months ago
2002
IEEE
Over the years, a variety of algorithms for finding frequent sequential patterns in very large sequential databases have been developed. The key feature in most of these algorith...
150
click to vote
ICDE
1999
IEEE
15 years 11 months ago
1999
IEEE
The ability to model the temporal dimension is essential to many applications. Furthermore, the rate of increase in database size and response time requirements has outpaced advan...