Sciweavers

14158 search results - page 64 / 2832
» Generalized switch-setting problems
Sort
View
MOC
2002
108views more  MOC 2002»
14 years 9 months ago
Convergence of the multigrid $V$-cycle algorithm for second-order boundary value problems without full elliptic regularity
The multigrid V -cycle algorithm using the Richardson relaxation scheme as the smoother is studied in this paper. For second-order elliptic boundary value problems, the contraction...
Susanne C. Brenner
SIAMJO
2010
125views more  SIAMJO 2010»
14 years 4 months ago
Trading Accuracy for Sparsity in Optimization Problems with Sparsity Constraints
We study the problem of minimizing the expected loss of a linear predictor while constraining its sparsity, i.e., bounding the number of features used by the predictor. While the r...
Shai Shalev-Shwartz, Nathan Srebro, Tong Zhang
EOR
2002
68views more  EOR 2002»
14 years 9 months ago
The computational complexity of the criticality problems in a network with interval activity times
The paper analyzes the criticality in a network with interval activities duration times. A natural generalization of the criticality notion (for a path, an activity and an event) ...
Stefan Chanas, Pawel Zielinski
ISCC
2002
IEEE
147views Communications» more  ISCC 2002»
15 years 2 months ago
A new method for finding generalized frequent itemsets in generalized association rule mining
Generalized association rule mining is an extension of traditional association rule mining to discover more informative rules, given a taxonomy. In this paper, we describe a forma...
Kritsada Sriphaew, Thanaruk Theeramunkong
JCST
2008
119views more  JCST 2008»
14 years 9 months ago
Mining Frequent Generalized Itemsets and Generalized Association Rules Without Redundancy
This paper presents some new algorithms to efficiently mine max frequent generalized itemsets (g-itemsets) and essential generalized association rules (g-rules). These are compact ...
Daniel Kunkle, Donghui Zhang, Gene Cooperman