One of the biggest problems in computer graphics is displaying huge geometric models at interactive rates. A lot of work has been done to achieve the required frame-rates in architecture, simulation, computer-aided design and entertainment applications. In this paper, a system that enables walkthrough in complex environments using level-of-detail approximations is explained. The system uses hie...

Background and Aim: Management of children’s behavior is fundamental to a successful and effective dental treatment for children. This study aimed to evaluate the perceptions of dental students towards behavior guidance techniques in pediatric dentistry. Materials and Methods: This cross-sectional study was carried out on dental students from three different levels of education. A questionnair...

This article discusses an approach for hierarchical multilevel fault simulation for large systems described at the transistor, gate, and higher levels. The approach reduces the memory requirement of the simulation drastically, thus allowing the simulation of circuits that are too large to simulate at one flat level on typical engineering workstations. This is achieved by exploiting the regulari...

Sparse languages play an important role in classical structural complexity theory. In this paper we introduce a natural definition of sparse problems for parameterized complexity theory. We prove an analog of Mahaney’s theorem: there is no sparse parameterized problem which is hard for the tth level of the W hierarchy, unless the W hierarchy itself collapses up to level t. The main result is pr...

In this paper, a comprehensive algorithm is developed to analyze the sensitivity of hierarchical decision models (HDM), including the analytic hierarchy process and its variants, to single and multiple changes in the local contribution matrices at any level of the decision hierarchy. The algorithm is applicable to all HDM that use an additive function to derive the overall contribution vector. ...

The Lasserre hierarchy is a systematic procedure for constructing a sequence of increasingly tight relaxations that capture the convex formulations used in the best available approximation algorithms for a wide variety of optimization problems. Despite the increasing interest, there are very few techniques for analyzing Lasserre integrality gaps. Satisfying the positive semi-definite requiremen...

Conventional memory systems are organized as a rigid hierarchy, with multiple levels of progressively larger and slower memories. Hierarchy allows a simple, fixed design to benefit a wide range of applications, because working sets settle at the smallest (and fastest) level they fit in. However, rigid hierarchies also cause significant overheads, because each level adds latency and energy even ...

We explore techniques for maintaining consistency in reasoning when employing dynamic hierarchical task decompositions. In particular, we consider the difficulty of maintaining consistency when an agent nonmonotonically modifies an assumption in one level of the task hierarchy and that assumption depends upon potentially dynamic assertions higher in the hierarchy. The hypothesis of our work is ...