Search Results - "Eğecioğlu, Ö"

Refine Results
  1. 1

    Smoothed particle hydrodynamics techniques for the solution of kinetic theory problems Part 1: Method by Chaubal, C.V, Srinivasan, A, Eğecioğlu, Ö, Leal, L.G

    “…The smoothed particle hydrodynamics (SPH) technique has been applied to a problem in kinetic theory, namely, the dynamics of liquid crystalline polymers…”
    Get full text
    Journal Article
  2. 2

    Evolutionary expansion and specialization of the PDZ domains by Sakarya, O, Conaco, C, Egecioglu, O, Solla, S A, Oakley, T H, Kosik, K S

    Published in Molecular biology and evolution (01-05-2010)
    “…PDZ domains are protein-protein interaction modules widely used to assemble membranous signaling complexes including those found in the neuronal synapse…”
    Get full text
    Journal Article
  3. 3

    Dimensionality reduction and similarity computation by inner-product approximations by Egecioglu, O., Ferhatosmanoglu, H., Ogras, U.

    “…As databases increasingly integrate different types of information such as multimedia, spatial, time-series, and scientific data, it becomes necessary to…”
    Get full text
    Journal Article
  4. 4

    A new approach to sequence comparison: normalized sequence alignment by Arslan, Abdullah N., Eğecioğlu, Ömer, Pevzner, Pavel A.

    Published in Bioinformatics (01-04-2001)
    “…The Smith–Waterman algorithm for local sequence alignment is one of the most important techniques in computational molecular biology. This ingenious dynamic…”
    Get full text
    Journal Article
  5. 5

    Image compression for fast wavelet-based subregion retrieval by Poulakidas, A.S., Srinivasan, A., Eğecioğlu, Ö., Ibarra, O., Yang, T.

    Published in Theoretical computer science (17-06-2000)
    “…In an image browsing environment there is need for progressively viewing image subregions at various resolutions. We describe a storage scheme that…”
    Get full text
    Journal Article
  6. 6

    Stable Factorization of Strictly Hurwitz Polynomials by Eğecioğlu, Ömer, B. Siddik Yarman

    “…We propose a stable factorization procedure to generate a strictly Hurwitz polynomial from a given strictly positive even polynomial. This problem typically…”
    Get full text
    Journal Article
  7. 7

    Lower bounds on communication loads and optimal placements in torus networks by Azizoglu, M.C., Egecioglu, O.

    Published in IEEE transactions on computers (01-03-2000)
    “…Fully populated torus-connected networks, where every node has a processor attached, do not scale well since load on edges increases superlinearly with network…”
    Get full text
    Journal Article
  8. 8

    Asynchronous spiking neural P systems by Cavaliere, Matteo, Ibarra, Oscar H., Păun, Gheorghe, Egecioglu, Omer, Ionescu, Mihai, Woodworth, Sara

    Published in Theoretical computer science (28-05-2009)
    “…We consider here spiking neural P systems with a non-synchronized (i.e., asynchronous) use of rules: in any step, a neuron can apply or not apply its rules…”
    Get full text
    Journal Article
  9. 9

    Automatic processor lower bound formulas for array computations by Cappello, P., Egecioglu, O.

    “…In the directed acyclic graph (dag) model of algorithms, consider the following problem for precedence-constrained multiprocessor schedules for array…”
    Get full text
    Conference Proceeding
  10. 10

    Anónimos: An LP-Based Approach for Anonymizing Weighted Social Network Graphs by Das, S., Egecioglu, O., El Abbadi, A.

    “…The increasing popularity of social networks has initiated a fertile research area in information extraction and data mining. Anonymization of these social…”
    Get full text
    Journal Article
  11. 11

    Analysis of quorum-based protocols for distributed (k+1)-exclusion by Agrawal, D., Egecioglu, O., Abbadi, A.

    “…A generalization of the majority quorum for the solution of the distributed (k+1)-exclusion problem is proposed. This scheme produces a family of quorums of…”
    Get full text
    Journal Article
  12. 12
  13. 13

    Processor lower bound formulas for array computations and parametric Diophantine systems by Cappello, P., Egecioglu, O.

    “…Using a directed acyclic graph (dag) model of algorithms, we solve a problem related to precedence-constrained multiprocessor schedules for array computations…”
    Get full text
    Conference Proceeding Journal Article
  14. 14
  15. 15

    Lower bounds on communication loads and optimal placements in torus networks by Azizoglu, M.C., Egecioglu, O.

    “…Fully-populated tori, where every node has a processor attached do not scale well since load on edges increases superlinearly with network size under heavy…”
    Get full text
    Conference Proceeding Journal Article
  16. 16
  17. 17
  18. 18

    Catalytic P systems, semilinear sets, and vector addition systems by Ibarra, Oscar H., Dang, Zhe, Egecioglu, Omer

    Published in Theoretical computer science (01-01-2004)
    “…We look at 1-region membrane computing systems which only use rules of the form Ca→ Cv, where C is a catalyst, a is a noncatalyst, and v is a (possibly null)…”
    Get full text
    Journal Article
  19. 19

    Parallel algorithms for fast computation of normalized edit distances by Egecioglu, O., Ibel, M.

    “…The authors give work-optimal and polylogarithmic time parallel algorithms for solving the normalized edit distance problem. The normalized edit distance…”
    Get full text
    Conference Proceeding
  20. 20