Sciweavers

3299 search results - page 56 / 660
» A general mathematics of names
Sort
View
TCS
2008
14 years 11 months ago
Generalized approximate counting revisited
A large class of q-distributions is defined on the stochastic model of Bernoulli trials in which the probability of success (=advancing to the next level) depends geometrically on...
Guy Louchard, Helmut Prodinger
FCA
2005
Springer
207views Formal Methods» more  FCA 2005»
15 years 5 months ago
From Formal Concept Analysis to Contextual Logic
Abstract. A main goal of Formal Concept Analysis from its very beginning has been the support of rational communication. The source of this goal lies in our understanding of mathem...
Frithjof Dau, Julia Klinger
DEDS
2002
85views more  DEDS 2002»
14 years 11 months ago
A General Architecture for Decentralized Supervisory Control of Discrete-Event Systems
Abstract. We consider a generalized form of the conventional decentralized control architecture for discreteevent systems where the control actions of a set of supervisors can be `...
Tae-Sic Yoo, Stéphane Lafortune
COCO
2009
Springer
96views Algorithms» more  COCO 2009»
15 years 6 months ago
Reconstruction of Generalized Depth-3 Arithmetic Circuits with Bounded Top Fan-in
In this paper we give reconstruction algorithms for depth-3 arithmetic circuits with k multiplication gates (also known as ΣΠΣ(k) circuits), where k = O(1). Namely, we give an ...
Zohar Shay Karnin, Amir Shpilka
82
Voted
VL
2007
IEEE
125views Visual Languages» more  VL 2007»
15 years 6 months ago
Visual Reasoning by Generalized Interval-values and Interval Temporal Logic
Interval-valued computation is an unconventional computing paradigm. It is an idealization of classical 16-, 32-, 64- etc. bit based computations. It represents data as specific ...
Benedek Nagy, Sándor Vályi