نتایج جستجو برای: london plane tree

تعداد نتایج: 329965  

Journal: :Annals OR 2007
Gérard Cornuéjols

2006
K. Somasundaram I. Kaspar Raj

In this paper we have proposed three and two stage still gray scale image compressor based on BTC. In our schemes, we have employed a combination of four techniques to reduce the bit rate. They are quad tree segmentation, bit plane omission, bit plane coding using 32 visual patterns and interpolative bit plane coding. The experimental results show that the proposed schemes achieve an average bi...

Journal: :SIAM J. Discrete Math. 2015
Guantao Chen Hikoe Enomoto Kenta Ozeki Shoichi Tsuchiya

A Halin graph is a simple plane graph consisting of a tree without degree 2 vertices and a cycle induced by the leaves of the tree. In 1975, Lovász and Plummer conjectured that every 4-connected plane triangulation has a spanning Halin subgraph. In this paper, we construct an infinite family of counterexamples to the conjecture.

Journal: :CoRR 2017
Simina Brânzei Noam Nisan

We study the query complexity of cake cutting and give lower bounds for computing approximately envy-free, perfect, and equitable allocations with the minimum number of cuts. These lower bounds are tight for three players in the case of envy-free allocations and for two players in the case of perfect and equitable allocations. We also formalize moving knife procedures and show that a large subc...

Journal: :Eur. J. Comb. 2016
Michael Braun Michael Kiermaier Anamari Nakic

An Sq[t,k,v] q-Steiner system is a collection of k-dimensional subspaces of the v-dimensional vector space Fq over the finite field Fq with q elements, called blocks, such that each t-dimensional subspace of Fq is contained in exactly one block. The smallest admissible parameters for which a q-Steiner system could exist is S2[2,3,7]. Up to now the issue whether q-Steiner systems with these para...

1998
Chang-Sung Jeong Alex T. Pang

We present a new visualization technique, called (Reconfigurable Disc Tree) which can alleviate the disadvantages of cone trees significantly for large hierarchies while maintaining its context of using 3D depth. In , each node is associated with a disc around which its children are placed. Using discs instead of cones as the basic shape in has several advantages: significant reduction of occlu...

2017

Platanus orientalis L., the oriental plane perennial woody tree [1] with important riparian species [2] is widely spread in Crete and other southern islands. Its natural spread ranges from the southern Balkans, Crete, mountains of Turkey, Syria, Iran and Iraq, eastwardly to Kashmir valley, where it is familiarly known as the ‘chinar’. Chinar, Platanus orientalis kashmeriana, is the lone species...

Journal: :Electronic Notes in Discrete Mathematics 2008
Olivier Bernardi Guillaume Chapuy

Unicellular maps are a natural generalisation of plane trees to higher genus surfaces. In this article we study covered maps, which are maps together with a distinguished unicellular spanning submap. We prove that the covered maps of genus g with n edges are in bijection with pairs made of a plane tree with n edges and a bipartite unicellular map of genus g with n +1 edges. This generalises to ...

Journal: :RFC 1998
Muneyoshi Suzuki

Status of this Memo This memo provides information for the Internet community. It does not specify an Internet standard of any kind. Distribution of this memo is unlimited. Abstract This document specifies an ATM-based protocol for communication between ST2+ agents. The ST2+ over ATM protocol supports the matching of one hop in an ST2+ tree-structure stream with one ATM connection. In this docu...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید