Sciweavers

1303 search results - page 112 / 261
» Cyclic Association Rules
Sort
View
SIGMETRICS
2010
ACM
122views Hardware» more  SIGMETRICS 2010»
15 years 4 months ago
Heavy-traffic limits for nearly deterministic queues
We establish heavy-traffic limits for nearly deterministic queues, such as the G/D/n many-server queue. Since waiting times before starting service in the G/D/n queue are equivale...
Karl Sigman, Ward Whitt
TIT
2010
158views Education» more  TIT 2010»
15 years 1 months ago
Belief propagation, Dykstra's algorithm, and iterated information projections
Belief propagation is shown to be an instance of a hybrid between two projection algorithms in the convex programming literature: Dykstra's algorithm with cyclic Bregman proje...
John MacLaren Walsh, Phillip A. Regalia
ADMA
2010
Springer
248views Data Mining» more  ADMA 2010»
15 years 4 months ago
Classification Inductive Rule Learning with Negated Features
This paper reports on an investigation to compare a number of strategies to include negated features within the process of Inductive Rule Learning (IRL). The emphasis is on generat...
Stephanie Chua, Frans Coenen, Grant Malcolm
APAL
2010
123views more  APAL 2010»
15 years 6 months ago
Cut elimination and strong separation for substructural logics: An algebraic approach
Abstract. We develop a general algebraic and proof-theoretic study of substructural logics that may lack associativity, along with other structural rules. Our study extends existin...
Nikolaos Galatos, Hiroakira Ono
DATE
2008
IEEE
124views Hardware» more  DATE 2008»
16 years 25 days ago
Sizing Rules for Bipolar Analog Circuit Design
This paper presents sizing rules for basic building blocks in analog bipolar circuit design. Sizing rules efficiently capture design knowledge on the technology-specific level o...
Tobias Massier, Helmut E. Graeb, Ulf Schlichtmann