Omer Egecioglu | University of California, Santa Barbara (original) (raw)
Supervisors: Adriano Garsia
Phone: 1-805-893-3529
Address: Department of Computer Science
University of California,
Santa Barbara, CA 93106
USA
less
Uploads
Papers by Omer Egecioglu
In a recent paper we have presented a method to evaluate certain Hankel determinants as almost pr... more In a recent paper we have presented a method to evaluate certain Hankel determinants as almost products; i.e. as a sum of a small number of products. The technique to find the explicit form of the almost product relies on differential-convolution equations and trace calculations. In the trace calculations a number of intermediate nonlinear terms involving determinants occur, but only to cancel out in the end. In this paper, we introduce a class of multilinear operators \gamma acting on tuples of matrices as an alternative to the trace method. These operators do not produce extraneous nonlinear terms, and can be combined easily with differentiation. The paper is self contained. An example of an almost product evaluation using \gamma-operators is worked out in detail and tables of the \gamma-operator values on various forms of matrices are provided. We also present an explicit evaluation of a new class of Hankel determinants and conjectures.
Distributed and Parallel Databases, 2005
Lecture Notes in Computer Science, 2002
Abstract. Given sequences X of length n and Y of length m with n ≥ m, let LAt ∗ and NLAt ∗ denote... more Abstract. Given sequences X of length n and Y of length m with n ≥ m, let LAt ∗ and NLAt ∗ denote the maximum ordinary, and max-imum length normalized scores of local alignments with length at least a given threshold value t. The alignment length is defined as the sum ...
Page 1. Algorithms For Local Alignment With Length Constraints? Abdullah N. Arslan and Omer E gec... more Page 1. Algorithms For Local Alignment With Length Constraints? Abdullah N. Arslan and Omer E gecio glu Department of Computer Science University of California, Santa Barbara CA 93106, USA farslan,omerg@cs.ucsb.edu Abstract. ...
Cocoon, 2001
Page 1. An Improved Upper Bound on the Size of Planar Convex-Hulls* Abdullah N. Arslan and ¨Omer ... more Page 1. An Improved Upper Bound on the Size of Planar Convex-Hulls* Abdullah N. Arslan and ¨Omer E˘gecio˘glu Department of Computer Science University of California, Santa Barbara CA 93106, USA {arslan,omer}@cs.ucsb.edu Abstract. ...
... BibTeX. @TECHREPORT{Azizoglu00thebisection, author = {M. Cemil Azizoglu and Ömer Egecioglu}, ... more ... BibTeX. @TECHREPORT{Azizoglu00thebisection, author = {M. Cemil Azizoglu and Ömer Egecioglu}, title = {The Bisection Width and the Isoperimetric Number of Arrays}, institution = {DISCRETE APPL. ... 81, Optimal assignments of numbers to vertices - Harper - 1964. ...
Proceedings of the Fifth Annual International Conference on Computational Biology, Apr 1, 2001
CiteSeerX - Document Details (Isaac Councill, Lee Giles): We develop dynamic dimensionality reduc... more CiteSeerX - Document Details (Isaac Councill, Lee Giles): We develop dynamic dimensionality reduction based on the approximation of the standard inner-product. This results in a family of fast algorithms for checking similarity of objects whose feature representations are large ...
Proceedings Ieee Infocom, Apr 19, 2009
The authors give work-optimal and polylogarithmic time parallel algorithms for solving the normal... more The authors give work-optimal and polylogarithmic time parallel algorithms for solving the normalized edit distance problem. The normalized edit distance between two strings X and Y with lengths n⩾m is the minimum quotient of the sum of the costs of edit operations transforming X into Y by the length of the edit path corresponding to those edit operations. Marzal and
The Electronic Journal of Combinatorics, 2008
CiteSeerX - Document Details (Isaac Councill, Lee Giles): Accurate and fast estimation of probabi... more CiteSeerX - Document Details (Isaac Councill, Lee Giles): Accurate and fast estimation of probability density functions is crucial for satisfactory computational performance in many scientific problems. When the type of density is known a priori, then the problem becomes statistical ...
Siam Journal on Discrete Mathematics, 2011
In a recent paper we have presented a method to evaluate certain Hankel determinants as almost pr... more In a recent paper we have presented a method to evaluate certain Hankel determinants as almost products; i.e. as a sum of a small number of products. The technique to find the explicit form of the almost product relies on differential-convolution equations and trace calculations. In the trace calculations a number of intermediate nonlinear terms involving determinants occur, but only to cancel out in the end. In this paper, we introduce a class of multilinear operators \gamma acting on tuples of matrices as an alternative to the trace method. These operators do not produce extraneous nonlinear terms, and can be combined easily with differentiation. The paper is self contained. An example of an almost product evaluation using \gamma-operators is worked out in detail and tables of the \gamma-operator values on various forms of matrices are provided. We also present an explicit evaluation of a new class of Hankel determinants and conjectures.
Distributed and Parallel Databases, 2005
Lecture Notes in Computer Science, 2002
Abstract. Given sequences X of length n and Y of length m with n ≥ m, let LAt ∗ and NLAt ∗ denote... more Abstract. Given sequences X of length n and Y of length m with n ≥ m, let LAt ∗ and NLAt ∗ denote the maximum ordinary, and max-imum length normalized scores of local alignments with length at least a given threshold value t. The alignment length is defined as the sum ...
Page 1. Algorithms For Local Alignment With Length Constraints? Abdullah N. Arslan and Omer E gec... more Page 1. Algorithms For Local Alignment With Length Constraints? Abdullah N. Arslan and Omer E gecio glu Department of Computer Science University of California, Santa Barbara CA 93106, USA farslan,omerg@cs.ucsb.edu Abstract. ...
Cocoon, 2001
Page 1. An Improved Upper Bound on the Size of Planar Convex-Hulls* Abdullah N. Arslan and ¨Omer ... more Page 1. An Improved Upper Bound on the Size of Planar Convex-Hulls* Abdullah N. Arslan and ¨Omer E˘gecio˘glu Department of Computer Science University of California, Santa Barbara CA 93106, USA {arslan,omer}@cs.ucsb.edu Abstract. ...
... BibTeX. @TECHREPORT{Azizoglu00thebisection, author = {M. Cemil Azizoglu and Ömer Egecioglu}, ... more ... BibTeX. @TECHREPORT{Azizoglu00thebisection, author = {M. Cemil Azizoglu and Ömer Egecioglu}, title = {The Bisection Width and the Isoperimetric Number of Arrays}, institution = {DISCRETE APPL. ... 81, Optimal assignments of numbers to vertices - Harper - 1964. ...
Proceedings of the Fifth Annual International Conference on Computational Biology, Apr 1, 2001
CiteSeerX - Document Details (Isaac Councill, Lee Giles): We develop dynamic dimensionality reduc... more CiteSeerX - Document Details (Isaac Councill, Lee Giles): We develop dynamic dimensionality reduction based on the approximation of the standard inner-product. This results in a family of fast algorithms for checking similarity of objects whose feature representations are large ...
Proceedings Ieee Infocom, Apr 19, 2009
The authors give work-optimal and polylogarithmic time parallel algorithms for solving the normal... more The authors give work-optimal and polylogarithmic time parallel algorithms for solving the normalized edit distance problem. The normalized edit distance between two strings X and Y with lengths n⩾m is the minimum quotient of the sum of the costs of edit operations transforming X into Y by the length of the edit path corresponding to those edit operations. Marzal and
The Electronic Journal of Combinatorics, 2008
CiteSeerX - Document Details (Isaac Councill, Lee Giles): Accurate and fast estimation of probabi... more CiteSeerX - Document Details (Isaac Councill, Lee Giles): Accurate and fast estimation of probability density functions is crucial for satisfactory computational performance in many scientific problems. When the type of density is known a priori, then the problem becomes statistical ...
Siam Journal on Discrete Mathematics, 2011