Sciweavers

849 search results - page 60 / 170
» On the Complexity of the Whitehead Minimization Problem
Sort
View
ICDE
2007
IEEE
123views Database» more  ICDE 2007»
14 years 2 months ago
Privacy Preserving Pattern Discovery in Distributed Time Series
The search for unknown frequent pattern is one of the core activities in many time series data mining processes. In this paper we present an extension of the pattern discovery pro...
Josenildo Costa da Silva, Matthias Klusch
ISMVL
1997
IEEE
134views Hardware» more  ISMVL 1997»
14 years 1 days ago
Functional Decomposition of MVL Functions Using Multi-Valued Decision Diagrams
In this paper, the minimization of incompletely specified multi-valued functions using functional decomposition is discussed. From the aspect of machine learning, learning sample...
Craig M. Files, Rolf Drechsler, Marek A. Perkowski
DAGSTUHL
2004
13 years 9 months ago
Learning with Local Models
Next to prediction accuracy, the interpretability of models is one of the fundamental criteria for machine learning algorithms. While high accuracy learners have intensively been e...
Stefan Rüping
SIAMSC
2008
139views more  SIAMSC 2008»
13 years 7 months ago
Probing the Pareto Frontier for Basis Pursuit Solutions
The basis pursuit problem seeks a minimum one-norm solution of an underdetermined least-squares problem. Basis pursuit denoise (BPDN) fits the least-squares problem only approximat...
Ewout van den Berg, Michael P. Friedlander
ECCC
2000
140views more  ECCC 2000»
13 years 7 months ago
Randomized Approximation Schemes for Scheduling Unrelated Parallel Machines
We consider the problem of Scheduling n Independent Jobs on m Unrelated Parallel Machines, when the number of machines m is xed. We address the standard problem of minimizing the ...
Pavlos Efraimidis, Paul G. Spirakis