نتایج جستجو برای: line w

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

Journal: :Discrete Mathematics 1979
Andrzej Ehrenfeucht D. M. Silberger

In 1979 Ehrenfeucht and Silberger published an article [9] where the relationship between the length of a word and the maximum length of its unbordered factors (segments) was for the first time investigated. Periodicity and borderedness are two basic properties of words that play a rôle in many areas of computer science such as string searching algorithms [13, 3, 7], data compression [20, 6], a...

2016

1 Notion We introduce some notions used in this supplementary material. For regression task, we define y max = max y |y|. We further denote the set S as S = B 0, y max λ −1/2 if L2 is used and λ ≤1 R D otherwise where B 0, y max λ −1/2 = w ∈ R D : w ≤ y max λ −1/2 and R D specifies the whole feature space. We introduce five types of loss functions that can be used in our proposed algorithm, nam...

1999
D. V. Giri

The available analytic solutions for a periodic array of symmetric in-line wave launchers have been used in characterizing the high-frequency ● propagation along the launchers. These analytic solutions are based on a high-frequency asymptotic formulation of the multiconductor transmission-line equations. In particular, a family of curves that permit a desired highfrequency voltage transfer rati...

2013
Steven Chaplick Elad Cohen Gila Morgenstern

We study a geometric hitting set problem involving unirectional rays and curves in the plane. We show that this problem is hard to approximate within a logarithmic factor even when the curves are convex polygonal x-monotone chains. Additionally, it is hard to approximate within a factor of 76 even when the curves are line segments with bounded slopes. Lastly, we demonstrate that the problem is ...

Journal: :Combinatorics, Probability & Computing 2015
Pu Gao Nicholas C. Wormald

Let h > w > 0 be two fixed integers. Let H be a random hypergraph whose hyperedges are all of cardinality h. To w-orient a hyperedge, we assign exactly w of its vertices positive signs with respect to the hyperedge, and the rest negative. A (w, k)-orientation of H consists of a w-orientation of all hyperedges of H, such that each vertex receives at most k positive signs from its incident hypere...

2017
Jie-Ping Lei Juan-Juan Yuan Sheng-Hao Pi Rui Wang Rui Tan Chao-Ying Ma Tao Zhang He-Zhong Jiang

BACKGROUND The genus Wikstroemia has about 70 species, but only a limited number of species have been studied chemically. Wikstroemia indica has long been used as a traditional crude drug in China. However, there is no report about the bioactivity of Wikstroemia scytophylla. OBJECTIVE This paper reports the chemical investigation and biological evaluation of the W. scytophylla. MATERIALS AN...

Journal: :journal of agricultural science and technology 2012
a. sadeghi

application of feed pellets in animal and aquatic farming industries has grown because of both the physical and the nutritional benefits it provides. development of feed pellets manufacturing industry is also considerable. steam conditioning process, which plays an important role in pelleting production, includes heating feed particles, adding moisture, and mixing the mash. pellets cooling and ...

2003
Tero Harju Dirk Nowotka

In 1979 Ehrenfeucht and Silberger published an article [9] where the relationship between the length of a word and the maximum length of its unbordered factors (segments) was for the first time investigated. Periodicity and borderedness are two basic properties of words that play a rôle in many areas of computer science such as string searching algorithms [13, 3, 7], data compression [20, 6], a...

2006
Éric Fusy

This article introduces a straight-line drawing algorithm for quadrangulations, in the family of the face-counting algorithms. It outputs in linear time a drawing on a regular W×H grid such that W+H = n − 1 −∆, where n is the number of vertices and ∆ is an explicit combinatorial parameter of the quadrangulation.

1995
Jirí Sgall

W e study randomized on-line scheduling on mesh machines. W e show that for scheduling independent jobs randomized algorithms can achieve a signijicanily better performance than de iemin i s t i c ones; on the oiher hand with dependencies randomization does not help.

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

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