نتایج جستجو برای: practically
تعداد نتایج: 20473 فیلتر نتایج به سال:
A labeling scheme is a method to retrieve some global property of a graph by exploiting (in a distributed fashion) the information stored, in the form of (short) labels, at its vertices. A classic question in the area is that of labeling the vertices in order to infer the distance between any pair of them, or alternatively to retrieve a corresponding shortest path. On such purpose, among the va...
The mobile workforce is rapidly increasing, and technological advances make it feasible for these workers to have ubiquitous access to a variety of resources with various protection requirements. The dynamic computing environment of these workers mandates a security paradigm in which security is tightly coupled with a user’s current situation. We have proposed a security paradigm to achieve thi...
We present CRISNER (Conditional & Relative Importance Statement Network PrEference Reasoner), a tool that provides practically efficient as well as exact reasoning about qualitative preferences in popular ceteris paribus preference languages such as CP-nets, TCPnets, CP-theories, etc. The tool uses a model checking engine to translate preference specifications and queries into appropriate Kripk...
PURPOSE Development of strategies to optimize the functional performance of older adults requires understanding the behavior of older people doing tasks in real-world settings and capturing these interactions in research protocols. This is a major challenge as there is some degree of tension between capturing the contextual variables and constraints that operate in the real world and the scale ...
When ontological knowledge is acquired automatically, quality control is essential. We consider the tightest possible approach – an exhaustive manual inspection of the acquired data. By using automated reasoning, we partially automate the process: after each expert decision, axioms that are entailed by the already approved statements are automatically approved, whereas axioms that would lead to...
Bit-decomposition is a powerful tool which can be used to design constant round protocols for bit-oriented multiparty computation (MPC) problems, such as comparison and Hamming weight computation. However, protocols that involve bit-decomposition are expensive in terms of performance. In this paper, we introduce a set of protocols for distributed exponentiation without bit-decomposition. We imp...
Image retrieval of landscape photographs requires accurate annotation using multi-faceted descriptions relating to the subject and content of the photograph. The subject of such photographs is dominantly the terrain and spatial objects visible from the photographer’s viewpoint. While some spatial objects in the background may be obscured by foreground vegetation, other visible spatial objects b...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید