Sciweavers

613 search results - page 45 / 123
» Finding and Fixing Faults
Sort
View
KDD
1998
ACM
190views Data Mining» more  KDD 1998»
15 years 6 months ago
Mining Segment-Wise Periodic Patterns in Time-Related Databases
Periodicity search, that is, searchfor cyclicity in time-related databases, is an interesting data mining problem. Mostprevious studies have been on finding full-cycle periodicity...
Jiawei Han, Wan Gong, Yiwen Yin
ICIAP
1997
ACM
15 years 6 months ago
A Simple and Effective Edge Detector
Nonlinear filtering based on a two concentric circular windows operator is introduced as a simple and effective way to find edges in image processing. The dual windows edge detecto...
C. Cafforio, Eugenio Di Sciascio, Cataldo Guaragne...
IPL
2008
95views more  IPL 2008»
15 years 1 months ago
Approximating maximum satisfiable subsystems of linear equations of bounded width
We consider the problem known as MAX-SATISFY: given a system of m linear equations over the rationals, find a maximum set of equations that can be satisfied. Let r be the width of...
Zeev Nutov, Daniel Reichman
JCT
2006
100views more  JCT 2006»
15 years 1 months ago
Approximating clique-width and branch-width
We construct a polynomial-time algorithm to approximate the branch-width of certain symmetric submodular functions, and give two applications. The first is to graph "clique-wi...
Sang-il Oum, Paul D. Seymour
CORR
2002
Springer
106views Education» more  CORR 2002»
15 years 1 months ago
On model selection and the disability of neural networks to decompose tasks
A neural network with fixed topology can be regarded as a parametrization of functions, which decides on the correlations between functional variations when parameters are adapted...
Marc Toussaint