Filters

2,007,458 Hits in 3.6 sec

### Longest segment problems

H. Zantema
1992 Science of Computer Programming
., Longest segment problems, Science of Computer Programming 18 (1992) 39-66.  ...  The following problem is considered: given a predicate p on strings, determine the longest segment of a given string that satisfies p.  ...  A problem of this shape we call a longest segment problem, or, for short, a segment problem.  ...

### Segmentation problems, rhythmic solutions [chapter]

1994 The Acquisition of the Lexicon
problem for listeners.  ...  The origin of rhythmic segmentation may therefore lie in the infant's exploitation of rhythm to solve the segmentation problem and gain a first toehold on lexical acquisition.  ...  Cutler / Segmentation problems 89 words cannot be recognised till after their ends then segmentation by default would lose its very basis.  ...

### The Graph Segmentation Problem

Stephan Schwartz, Ralf Borndörfer, Gerald Bartz
2018 Electronic Notes in Discrete Mathematics
Given a network and a family of user paths, we study the graph segmentation problem (GSP) to cover parts of the user paths by a set of disjoint segments.  ...  We also show that the marginal utility of a segment is bounded. Computational results for real-world instances show that in practice the problem is more amenable than the theoretic bounds suggest.  ...  The graph segmentation problem is N P-hard. Proof. The set packing problem (SPP) with unit weights is one of the 21 classical N Phard problems presented by Karp [3] .  ...

### Segmentation problems, rhythmic solutions

Anne Cutler
1994 Lingua
problem for listeners.  ...  The origin of rhythmic segmentation may therefore lie in the infant's exploitation of rhythm to solve the segmentation problem and gain a first toehold on lexical acquisition.  ...  , namely those pertaining to how the prelinguistic infant first solves the segmentation problem.  ...

### On Two Segmentation Problems

Noga Alon, Benny Sudakov
1999 Journal of Algorithms
We also consider a segmented version of the minimum spanning tree problem, where we show that no approximation can be achieved in polynomial time, unless P=NP.  ...  The hypercube segmentation problem is the following: Given a set S of m vertices of the discrete d-dimensional cube {0, 1} d , find k vertices P 1 , . . . , P k , P i ∈ {0, 1} d and a partitions of S into  ...  Introduction called segmentation problems.  ...

### Cognitive level in problem segments and theory segments

Barbara Drollinger-Vetter, Frank Lipowsky, Christine Pauli, Kurt Reusser, Eckhard Klieme
2006 ZDM: Mathematics Education
Additionally, the lesson time was also divided into practice and theory segments.  ...  The results show that teachers with a high proportion of connection activities in practice segments do not necessarily also spend a greater proportion of time on an analogous level for theory.  ...  "Theory segments" are instruction segments in which either theory problems are worked on or else the theory is developed without problems.  ...

### SEGMENTAL SPINAL INSTABILITY: UNSOLVED PROBLEMS

Aleksandr Krutko, Evgeny Baikov, Nikolay Konovalоv, Anton Nazarenko
2017 Hirurgiâ pozvonočnika
An analytical review of the literature on the problem of segmental spinal instability is presented. The relevance of the investigated field of spine surgery is beyond doubt.  ...

### Risk segmentation: goal or problem?

Roger Feldman, Bryan Dowd
2000 Journal of Health Economics
This paper traces the evolution of economists' views about risk segmentation in health insurance markets.  ...  We suggest that risk segmentation may be efficient if one takes an Ž . ex post view i.e., after consumers' risks are known .  ...  The goal becomes a problem No sooner had managed care demonstrated its ability to segment risks, than risk Ž . segmentation began to be viewed not as a goal, but as a problem.  ...

### A note on the three-segment problem

Martin Doležal
2009 Mathematica Bohemica
It seems to be very probable that this problem is equivalent to the following one. In this form, the 'three-segment problem' is stated in [2] . (Another formulation can be found in [4] .)  ...  The theorem of [2] gives a partial answer to this problem.  ...

### Integrated Hybrid Segmentation to Overcome Problems in Brain Tumor Segmentation

A. C. Prabu, S. Narayanamoorthy
2016 Indian Journal of Science and Technology
Findings: The problem of false segmentation and segmentation with low accuracy that prevails in the brain image segmentation can be overcome by using this approach.  ...  The integrated hybrid segmentation approach has better segmentation accuracy than other segmentation approaches with 6% improvement which is very significant.  ...  This method reduces the over segmentation problem by creating boundaries with markers around the tumor regions.  ...

### Unsolved Problems in Visibility Graphs of Points, Segments and Polygons [article]

Subir Kumar Ghosh, Partha Pratim Goswami
2012 arXiv   pre-print
In this survey paper, we present open problems and conjectures on visibility graphs of points, segments and polygons along with necessary backgrounds for understanding them.  ...  This problem is called the segment visibility graph recognition problem.  ...  Open Problem 13 Characterize the segment visibility graphs. Open Problem 14 Given a segment visibility graph G, draw the segments S in the plane whose visibility graph is G.  ...

### Improving Segmentation for Technical Support Problems [article]

Kushal Chauhan, Abhirut Gupta
2020 arXiv   pre-print
In this paper, we address the problem of segmentation for technical support questions. We formulate the problem as a sequence labelling task, and study the performance of state of the art approaches.  ...  Technical support problems are often long and complex. They typically contain user descriptions of the problem, the setup, and steps for attempted resolution.  ...  Correctly identifying these segments can also augment problem understanding.  ...

### An Inventory Problem with Segmented Deliveries

A. H. Kairo
1977 Vikalpa The Journal for Decision Makers
the total number of segmented deliveries.  ...  An inventory problem involving splitting of an order into a number of staggered deliveries for a finite time horizon and known demand is described in this paper.  ...  We seek to determine the optimal number of segmented deliveries which minimizes total cost.  ...

### Focal segmental glomerulosclerosis: a diagnostic problem

Wiesława Salwa-Żurawska, Jakub Zurawski, Aldona Woźniak, Paweł Burchardt
2012 Polish Journal of Pathology
Focal segmental glomerulosclerosis (FSGS) is an important clinical problem as it leads to end-stage renal disease. Clinicians have long been able to treat patients with FSGS.  ...  The FSGS poses an important clinical problem as it leads to end-stage renal disease in 25-30% of patients after 5 years, and in 30-40% after ten years of the disease duration [1] .  ...  They are of focal and segmental character (at least at the early stage). Most commonly, the most severe lesions are observed in the segments located in the vicinity of the vascular pole.  ...

### Longest segment of balanced parentheses – an exercise in program inversion in a segment problem (Functional Pearl) [article]

Shin-Cheng Mu, Tsung-Ju Chiang
2021 arXiv   pre-print
We find this problem interesting because it involves a combination of techniques: the usual approach for solving segment problems, and a theorem for constructing the inverse of a function -- through which  ...  Given a string of parentheses, the task is to find the longest consecutive segment that is balanced, in linear time.  ...  We also consider a reduced version of the problem in which we return only the length of the segment.  ...
« Previous Showing results 1 — 15 out of 2,007,458 results