2107 search results - page 248 / 422 » Computing Small Search Numbers in Linear Time |
137
click to vote
AUSDM
2008
Springer
15 years 5 months ago
2008
Springer
LBR is a highly accurate classification algorithm, which lazily constructs a single Bayesian rule for each test instance at classification time. However, its computational complex...
147
Voted
VTS
2007
IEEE
15 years 10 months ago
2007
IEEE
Conventional error correcting code (ECC) schemes used in memories and caches cannot correct double bit errors caused by a single event upset (SEU). As memory density increases, mu...
139
Voted
AUSAI
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. Association rule mining is a data mining technique that reveals interesting relationships in a database. Existing approaches employ different parameters to search for int...
131
Voted
ICDM
2006
IEEE
15 years 9 months ago
2006
IEEE
Many previous works of data mining user queries in Peer-to-Peer systems focused their attention on the distribution of query contents. However, few has been done towards a better ...
162
Voted
TNN
2008
15 years 3 months ago
2008
Abstract--Large-margin methods, such as support vector machines (SVMs), have been very successful in classification problems. Recently, maximum margin discriminant analysis (MMDA) ...