Sciweavers

681 search results - page 101 / 137
» General Polynomial Time Decomposition Algorithms
Sort
View
KDD
2005
ACM
86views Data Mining» more  KDD 2005»
14 years 11 months ago
Probabilistic workflow mining
In several organizations, it has become increasingly popular to document and log the steps that makeup a typical business process. In some situations, a normative workflow model o...
Ricardo Silva, Jiji Zhang, James G. Shanahan
GLVLSI
2009
IEEE
131views VLSI» more  GLVLSI 2009»
14 years 5 months ago
Octilinear redistributive routing in bump arrays
This paper proposes a scheme for automatic re-distribution layer (RDL) routing, which is used in chip-package connections. Traditional RDL routing designs are mostly performed man...
Renshen Wang, Chung-Kuan Cheng
SIGECOM
2009
ACM
114views ECommerce» more  SIGECOM 2009»
14 years 5 months ago
Policy teaching through reward function learning
Policy teaching considers a Markov Decision Process setting in which an interested party aims to influence an agent’s decisions by providing limited incentives. In this paper, ...
Haoqi Zhang, David C. Parkes, Yiling Chen
ICDM
2005
IEEE
142views Data Mining» more  ICDM 2005»
14 years 4 months ago
Shortest-Path Kernels on Graphs
Data mining algorithms are facing the challenge to deal with an increasing number of complex objects. For graph data, a whole toolbox of data mining algorithms becomes available b...
Karsten M. Borgwardt, Hans-Peter Kriegel
ECML
2003
Springer
14 years 4 months ago
Robust k-DNF Learning via Inductive Belief Merging
A central issue in logical concept induction is the prospect of inconsistency. This problem may arise due to noise in the training data, or because the target concept does not fit...
Frédéric Koriche, Joël Quinquet...