Sciweavers

43 search results - page 7 / 9
» Bounds for the Loss in Probability of Correct Classification...
Sort
View
TCAD
1998
115views more  TCAD 1998»
13 years 5 months ago
Probabilistic modeling of dependencies during switching activity analysis
—This paper addresses, from a probabilistic point of view, the issue of switching activity estimation in combinational circuits under the zero-delay model. As the main theoretica...
Radu Marculescu, Diana Marculescu, Massoud Pedram
PRL
2008
85views more  PRL 2008»
13 years 5 months ago
Reliability estimation of a statistical classifier
Pattern classification techniques derived from statistical principles have been widely studied and have proven powerful in addressing practical classification problems. In real-wo...
Pandu Ranga Rao Devarakota, Bruno Mirbach, Bjö...
INFOCOM
2002
IEEE
13 years 10 months ago
Performance Analysis of Deflection Routing in Optical Burst-Switched Networks
This paper concerns itself with the performance of deflection routing in optical burst-switched networks based on Just-Enough-Time (JET) signaling. Generally speaking, buffer requi...
Ching-Fang Hsu, Te-Lung Liu, Nen-Fu Huang
IJCAI
1993
13 years 6 months ago
Learning Decision Lists over Tree Patterns and Its Application
This paper introduces a new concept, a decision tree (or list) over tree patterns, which is a natural extension of a decision tree (or decision list), for dealing with tree struct...
Satoshi Kobayashi, Koichi Hori, Setsuo Ohsuga
PDCAT
2005
Springer
13 years 10 months ago
A New Algorithm to Solve Synchronous Consensus for Dependent Failures
Fault tolerant algorithms are often designed under the t-out-of-n assumption, which is based on the assumption that all processes or components fail independently with equal proba...
Jun Wang, Min Song