Light fie ld re c o n stru c tio n is still m o stly lim ite d to sta tic sc e n e s o r is o n ly a p p lic a b le to d y n a m ic sc e n e s u sin g so p histic a te d a n d c o stly ha rd w a re . In c o n tra st to tha t, o u r c o n trib u tio n d e sc rib e s a sy ste m w hich a llo w s the re c o n stru c tio n o f a light fie ld o f a sc e n e in c lu d in g o n e o r m o re rigid ly m ...

In this paper, we consider the partial gathering problem of mobile agents in asynchronous unidirectional rings equipped with whiteboards on nodes. The partial gathering problem is a new generalization of the total gathering problem. The partial gathering problem requires, for a given integer g, that each agent should move to a node and terminate so that at least g agents should meet at the same...

A new genetic algoriihm for channel routing in $he physical design process of L'LSI circtiis i5 prestsfed. The algorithm is bused on a problem specific represen-iadion scheme and problem speciJc genetic operators. The geneiic encoding and our genelic operators are descrabed in defoii. The performance of.the algoriihnt is tested on difleerrnl benchmarks and it is shown that the results obdained ...

Data ow programming models are suitable to express multi-core streaming appli-cations. The design of high-quality embedded systems in that context requires static analysis toensure the liveness and bounded memory of the application. However, many streaming applicationshave a dynamic behavior. The previously proposed data ow models for dynamic applications donot provide any stati...

An algorithm is developed for finding a close to optimal junction tree of a given graph G. The algorithm has a worst case complexity 0 (c k n a) where a and c are constants, n is the number of vertices , and k is the size of the largest clique in a junction tree of Gi n which this size is minimized. The algorithm guaran­ tees that the logarithm of the size of the state space of the heaviest cli...

The complexity of distributed edge coloring depends heavily on the palette size as a functionof the maximum degree ∆. In this paper we explore the complexity of edge coloring in theLOCAL model in different palette size regimes. Our results are as follows. • We simplify the round elimination technique of Brandt et al. [9] and prove that (2∆− 2)-edge coloring requires Ω(log∆ log n...

In this paper we summarize the main results of where an algo rithm of shape preserving C spline interpolation for arbitrary D discrete data is developed We consider a classi cation of such data to separate the sec tions of linearity the angles and the breaks For remaining data we give a local algorithm of C interpolation by generalized splines with automatic choice of the parameters to retain t...

Algorithms for prediction of RNA secondary structure— the set of base pairsthat form when an RNA molecule folds— are valuable to biologists who aim tounderstand RNA structure and function. Improving the accuracy and efficiencyof prediction methods is an ongoing challenge, particularly for pseudoknottedsecondary structures, in which base pairs overlap. This challenge is biologica...

Variations of word order are among the most well-known phenomena of natural languages. From st well represented sample of world languages, Steele[13] shows that about 76% of languages exhibit significant word order variation. In addition to the wellknown Walpiri(Australian language), several languages such as Japanese, Thai, German, Hindi, and Finnish also allow considerable word order variatio...

In this article, the problem of detecting and removing on the development of practical and efficient algorithms to be anomalies in digitized animation film is addressed. The impetus of incorporated directly into the animation production system. this article comes from the motion picture industry, where several There has been a good amount of work in the literature dealing studios are rereleasin...