4679 search results - page 625 / 936 » Modeling When Connections Are the Problem |
165
click to vote
QEST
2008
IEEE
16 years 29 days ago
2008
IEEE
We begin by observing that (discrete-time) QuasiBirth-Death Processes (QBDs) are equivalent, in a precise sense, to (discrete-time) probabilistic 1-Counter Automata (p1CAs), and b...
206
click to vote
ARGMAS
2004
Springer
16 years 2 hour ago
2004
Springer
This paper compares within the MAS framework two separate threads in the formal study of epistemic change: belief revision and argumentation theories. Belief revision describes how...
212
click to vote
IWVF
2001
Springer
15 years 11 months ago
2001
Springer
Volumetric images of small mortar samples under load are acquired by X-ray microtomography. The images are binarized at many different threshold values, and over a million connecte...
172
click to vote
SODA
2008
ACM
15 years 8 months ago
2008
ACM
We show a tight lower bound of (N log log N) on the number of transmission required to compute the parity of N bits (with constant error) in a network of N randomly placed sensors...
192
click to vote
BMCBI
2007
15 years 6 months ago
2007
Background: Most existing algorithms for the inference of the structure of gene regulatory networks from gene expression data assume that the activity levels of transcription fact...