1405 search results - page 25 / 281 » We Are No Longer A Priesthood |
103
click to vote
CANS
2008
Springer
15 years 2 months ago
2008
Springer
We propose a message recognition protocol which is suitable for ad hoc pervasive networks without the use of hash chains. Hence, we no longer require the devices to save values of ...
UAI
2008
15 years 1 months ago
2008
We conjecture that the worst case number of experiments necessary and sufficient to discover a causal graph uniquely given its observational Markov equivalence class can be specif...
76
Voted
WOA
2001
15 years 1 months ago
2001
In this paper, we identify and analyze a set of issues that are more and more influencing the characteristics of today's complex software systems, and that distinguish them f...
113
Voted
IVC
2008
15 years 15 days ago
2008
In this work, we propose an original method of resolution of the shape from shading problem, which is accurate and converges with a few iterations. It relies on two simple ideas. ...
ENTCS
2007
15 years 14 days ago
2007
We develop a general testing scenario for probabilistic processes, giving rise to two theories: probabilistic may testing and probabilistic must testing. These are applied to a si...