Sciweavers

4894 search results - page 466 / 979
» The Guarding Problem - Complexity and Approximation
Sort
View
JAIR
2006
113views more  JAIR 2006»
15 years 6 months ago
Generative Prior Knowledge for Discriminative Classification
We present a novel framework for integrating prior knowledge into discriminative classifiers. Our framework allows discriminative classifiers such as Support Vector Machines (SVMs...
Arkady Epshteyn, Gerald DeJong
157
Voted
MLDM
2008
Springer
15 years 6 months ago
Distributed Monitoring of Frequent Items
Monitoring frequently occuring items is a recurring task in a variety of applications. Although a number of solutions have been proposed there has been few to address the problem i...
Robert Fuller, Mehmed M. Kantardzic
169
Voted
IJCSA
2007
110views more  IJCSA 2007»
15 years 6 months ago
Multiprocessor Scheduling Using Hybrid Particle Swarm Optimization with Dynamically Varying Inertia
The problem of task assignment in heterogeneous computing systems has been studied for many years with many variations. We have developed a new hybrid approximation algorithm. The...
S. N. Sivanandam, P. Visalakshi, A. Bhuvaneswari
141
Voted
JDA
2007
73views more  JDA 2007»
15 years 6 months ago
Parameterized matching with mismatches
The problem of approximate parameterized string searching consists of finding, for a given text t = t1t2 ...tn and pattern p = p1p2 ...pm over respective alphabets Σt and Σp, t...
Alberto Apostolico, Péter L. Erdös, Mo...
CORR
2002
Springer
132views Education» more  CORR 2002»
15 years 6 months ago
Robust Feature Selection by Mutual Information Distributions
Mutual information is widely used in artificial intelligence, in a descriptive way, to measure the stochastic dependence of discrete random variables. In order to address question...
Marco Zaffalon, Marcus Hutter