Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
254
Comparing Distance Bounding Protocols: a Critical Mission Supported by Decision Theory
, 2015
"... Distance bounding protocols are security countermeasures designed to thwart relay attacks. Such attacks consist in relaying messages exchanged between two parties, making them believe they communicate directly with each other. Although distance bounding protocols have existed since the early ninetie ..."
Abstract
- Add to MetaCart
to fairly compare the protocols in spite of their various properties. This paper introduces such a methodology based on concepts from the decision making field. The methodology allows for a multi-criteria comparison of distance bounding protocols, thereby identifying the most appropriate protocols once
Collection Tree Protocol
"... This paper presents and evaluates two principles for designing robust, reliable, and efficient collection protocols. These principles allow a protocol to benefit from accurate and agile link estimators by handling the dynamism such estimators introduce to routing tables. The first is datapath valida ..."
Abstract
- Add to MetaCart
This paper presents and evaluates two principles for designing robust, reliable, and efficient collection protocols. These principles allow a protocol to benefit from accurate and agile link estimators by handling the dynamism such estimators introduce to routing tables. The first is datapath
Flush: A Reliable Bulk Transport Protocol for Multihop Wireless Networks
"... We present Flush, a reliable, high goodput bulk data trans-port protocol for wireless sensor networks. Flush provides end-to-end reliability, reduces transfer time, and adapts to time-varying network conditions. It achieves these proper-ties using end-to-end acknowledgments, implicit snooping of con ..."
Abstract
- Add to MetaCart
We present Flush, a reliable, high goodput bulk data trans-port protocol for wireless sensor networks. Flush provides end-to-end reliability, reduces transfer time, and adapts to time-varying network conditions. It achieves these proper-ties using end-to-end acknowledgments, implicit snooping
Collapsing three-manifolds under a lower curvature bound
- J. Differential Geom
"... Abstract The purpose of this paper is to completely characterize the topology of threedimensional Riemannian manifolds with a uniform lower bound of sectional curvature which converges to a metric space of lower dimension. Introduction We study the topology of three-dimensional Riemannian manifolds ..."
Abstract
-
Cited by 30 (3 self)
- Add to MetaCart
shioya & takao yamaguchi In Section 7, we construct collapsing metrics with a lower curvature bound on three-manifolds to prove Theorem 0.6. In Section 8, we discuss the bounded curvature collapsing of threemanifolds with some construction of collapsing metrics, and compare our main results with them
A Challenging Example Background to Qualitative Decision Theory
"... s This article provides an overview of the field of qualitative decision theory: its motivating tasks and issues, its antecedents, and its prospects. Qualitative decision theory studies qualitative approaches to problems of decision making and their sound and effective reconciliation and integratio ..."
Abstract
- Add to MetaCart
and integration with quantitative approaches. Although it inherits from a long tradition, the field offers a new focus on a number of important unanswered questions of common concern to AI, economics, law, psychology, and management. T he field of decision theory and its companion methodology of decision analysis
1 General Classes of Lower Bounds on the Probability of Error in Multiple Hypothesis Testing
"... ar ..."
Theory of Computing Systems
"... Abstract. It is well known that simple randomized load balancing schemes can balance load effectively while incurring only a small overhead, making such schemes appealing for practical systems. In this paper we provide new analyses for several such dynamic randomized load balancing schemes. Our work ..."
Abstract
- Add to MetaCart
Abstract. It is well known that simple randomized load balancing schemes can balance load effectively while incurring only a small overhead, making such schemes appealing for practical systems. In this paper we provide new analyses for several such dynamic randomized load balancing schemes. Our
Title of Document: QUANTUM MECHANICS AND QUANTUM INFORMATION THEORY
"... The principle aim of this dissertation is to investigate the philosophical application of quantum information theory to interpretational issues regarding the theory of quantum mechanics. Recently, quantum information theory has emerged as a potential source for such an interpretation. The main quest ..."
Abstract
- Add to MetaCart
The principle aim of this dissertation is to investigate the philosophical application of quantum information theory to interpretational issues regarding the theory of quantum mechanics. Recently, quantum information theory has emerged as a potential source for such an interpretation. The main
Remembering over the short-term: The case against the standard model.
- Annual Review of Psychology,
, 2002
"... s Abstract Psychologists often assume that short-term storage is synonymous with activation, a mnemonic property that keeps information in an immediately accessible form. Permanent knowledge is activated, as a result of on-line cognitive processing, and an activity trace is established "in&quo ..."
Abstract
-
Cited by 74 (0 self)
- Add to MetaCart
the target material and the distractor task to such an extent that interference between the two seems unlikely (e.g., This time-based performance loss seems consistent with decay theory. Note that a comparable result would not be found with verbal material because the subject could presumably rehearse
A Grouping Principle and Four Applications
- IEEE Transactions on Pattern Analysis and Machine Intelligence
, 2003
"... Abstract-Wertheimer's theory suggests a general perception law according to which objects having a quality in common get perceptually grouped. The Helmholtz principle is a quantitative version of this general grouping law. It states that a grouping is perceptually "meaningful" if its ..."
Abstract
-
Cited by 59 (6 self)
- Add to MetaCart
;low resolution" Jordan curves. We consider a lowresolution grid in the image, which for a sake of low complexity we take to be hexagonal, with mesh step m. The number of curves with length lm starting from a point and supported by the grid is bounded from above by 2 l . The overall number of low resolution
Results 1 - 10
of
254
