Sciweavers

613 search results - page 19 / 123
» The Model-Summary Problem and a Solution for Trees
Sort
View
ADBIS
1997
Springer
149views Database» more  ADBIS 1997»
13 years 11 months ago
Concurrency Control Protocol for Nested Transactions in Real-Time Databases
In this paper we consider real-time concurrency control for the nested transaction model. We analyze problems that have pure optimistic and pessimistic approaches. As the solution...
Ekaterina Pavlova, Igor Nekrestyanov
BIRTHDAY
2009
Springer
14 years 2 months ago
Covering a Tree by a Forest
Consider a tree T and a forest F. The paper discusses the following new problems: The Forest vertex-cover problem (FVC): cover the vertices of T by a minimum number of copies of tr...
Fanica Gavril, Alon Itai
SIAMDM
2008
139views more  SIAMDM 2008»
13 years 7 months ago
Approximate Integer Decompositions for Undirected Network Design Problems
A well-known theorem of Nash-Williams and Tutte gives a necessary and sufficient condition for the existence of k edge-disjoint spanning trees in an undirected graph. A corollary o...
Chandra Chekuri, F. Bruce Shepherd
CG
2005
Springer
13 years 7 months ago
A polar-plane-based method for natural illumination of plants and trees
We introduce an illumination method for outdoor scenes containing plants and trees. Our method supports multiresolution plant and tree models based on random L-systems. The method...
Maria J. Vicent, Vicente Rosell, Roberto Viv&oacut...
BICOB
2009
Springer
14 years 1 months ago
Generalized Binary Tanglegrams: Algorithms and Applications
Several applications require the joint display of two phylogenetic trees whose leaves are matched by inter-tree edges. This issue arises, for example, when comparing gene trees and...
Mukul S. Bansal, Wen-Chieh Chang 0002, Oliver Eule...