Prune and search is a method of solving optimization problems suggested by Nimrod Megiddo in 1983. The basic idea of the method is a recursiveâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

2015

2015

- Minati De, Subhas C. Nandy, Sasanka Roy
- J. Comput. Syst. Sci.
- 2015

Prune-and-search is an excellent algorithmic paradigm for solving various optimization problems. We provide a general scheme forâ€¦Â (More)

Is this relevant?

2010

2010

- Zhi-Jie Yan, Zhiliang Hong, Frank K. Soong
- 2010 IEEE International Conference on Acousticsâ€¦
- 2010

This paper presents a Rich-context Unit Selection (RUS) approach to high quality speech synthesis. Based upon our previous workâ€¦Â (More)

Is this relevant?

2006

2006

- F. Frances Yao
- 2006

This note concerns the computation of the convex hull of a given set P = {p1, p2, . . . , pn} of n points in the plane. Let hâ€¦Â (More)

Is this relevant?

2004

2004

- Chin-Chen Chang, Yuan-Hui Yu
- IJPRAI
- 2004

This paper proposes an efficient approach for human face detection and exact facial features location in a head-and-shoulderâ€¦Â (More)

Is this relevant?

2003

2003

- Chin-Hsiung Wu, Shi-Jinn Horng
- IEEE Trans. Parallel Distrib. Syst.
- 2003

The main contributions of this paper are in designing fast and scalable parallel algorithms for selection and median filteringâ€¦Â (More)

Is this relevant?

1997

1997

- JesÃºs GarcÃa-LÃ³pez, Pedro Ramos
- Symposium on Computational Geometry
- 1997

Fitting a set of points by a circle Jestis Garcfa-L6pezt Pedro A. Ramos* Given a set of points S = {pi,...,pn} in the euclidean dâ€¦Â (More)

Is this relevant?

1996

1996

- Sandeep Sen
- SPAA
- 1996

We describe a very simple deterministic parallel algorithm for linear programming in fixed dimension d that takes poly(log log nâ€¦Â (More)

Is this relevant?

1995

1995

- David G. Kirkpatrick, Jack Snoeyink
- Fundam. Inform.
- 1995

Motivated by problems in computational geometry, we investigate the complexity of nding a xed-point of the composition of two orâ€¦Â (More)

Is this relevant?

1993

1993

- David G. Kirkpatrick, Jack Snoeyink
- Symposium on Computational Geometry
- 1993

This paper gives optimal logarithmic-time algorithms for two problems related to computing vertices of Voronoi diagrams in theâ€¦Â (More)

Is this relevant?

Highly Cited

1993

Highly Cited

1993

- Shreesh Jadhav, Asish Mukhopadhyay
- Symposium on Computational Geometry
- 1993

The notion of a centerpoint of a finite set of points in two and higher dimensions is a generalisation of the concept of theâ€¦Â (More)

Is this relevant?