Sciweavers

2020 search results - page 11 / 404
» Speeding up Slicing
Sort
View
KDD
2009
ACM
180views Data Mining» more  KDD 2009»
14 years 8 months ago
Using graph-based metrics with empirical risk minimization to speed up active learning on networked data
Active and semi-supervised learning are important techniques when labeled data are scarce. Recently a method was suggested for combining active learning with a semi-supervised lea...
Sofus A. Macskassy
AIA
2006
13 years 9 months ago
Speeding Up Model-based Diagnosis by a Heuristic Approach to Solving SAT
Model-based diagnosis of technical systems requires both a simulation machinery and a logic calculus. The former is responsible for the system's behavior analysis, the latter...
Benno Stein, Oliver Niggemann, Theodor Lettmann
IPL
1998
177views more  IPL 1998»
13 years 7 months ago
A Common-Multiplicand Method to the Montgomery Algorithm for Speeding up Exponentiation
A common-multiplicand method to the Montgomery algorithm makes an improvement in speed when the right-to-left binary exponentiation is applied. The idea is that the same common pa...
JaeCheol Ha, Sang-Jae Moon
PARA
2004
Springer
14 years 25 days ago
Speeding up Parallel Graph Coloring
Abstract. This paper presents new efficient parallel algorithms for finding approximate solutions to graph coloring problems. We consider an existing shared memory parallel graph...
Assefaw Hadish Gebremedhin, Fredrik Manne, Tom Woo...
PKDD
2007
Springer
196views Data Mining» more  PKDD 2007»
14 years 1 months ago
Speeding Up Feature Subset Selection Through Mutual Information Relevance Filtering
A relevance filter is proposed which removes features based on the mutual information between class labels and features. It is proven that both feature independence and class condi...
Gert Van Dijck, Marc M. Van Hulle