Search Results - "Eğecioğlu, Ö"
-
1
Smoothed particle hydrodynamics techniques for the solution of kinetic theory problems Part 1: Method
Published in Journal of non-Newtonian fluid mechanics (1997)“…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
Evolutionary expansion and specialization of the PDZ domains
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
Dimensionality reduction and similarity computation by inner-product approximations
Published in IEEE transactions on knowledge and data engineering (01-06-2004)“…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
A new approach to sequence comparison: normalized sequence alignment
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
Image compression for fast wavelet-based subregion retrieval
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
Stable Factorization of Strictly Hurwitz Polynomials
Published in International journal of computers, communications & control (01-12-2010)“…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
Lower bounds on communication loads and optimal placements in torus networks
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
Asynchronous spiking neural P systems
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
Automatic processor lower bound formulas for array computations
Published in Proceedings International Symposium on Parallel Architectures, Algorithms and Networks. I-SPAN'02 (2002)“…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
Anónimos: An LP-Based Approach for Anonymizing Weighted Social Network Graphs
Published in IEEE transactions on knowledge and data engineering (01-04-2012)“…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
Analysis of quorum-based protocols for distributed (k+1)-exclusion
Published in IEEE transactions on parallel and distributed systems (01-05-1997)“…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
A parallel method for fast and practical high-order newton interpolation
Published in BIT (01-06-1990)Get full text
Journal Article -
13
Processor lower bound formulas for array computations and parametric Diophantine systems
Published in Proceedings - International Parallel Processing Symposium (1998)“…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
-
15
Lower bounds on communication loads and optimal placements in torus networks
Published in Proceedings - International Parallel Processing Symposium (1998)“…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
Parallel Hermite interpolation: an algebraic approach
Published in Computing (01-12-1989)Get full text
Conference Proceeding Journal Article -
17
Billiard quorums on the grid 1
Published in Information processing letters (1997)Get full text
Journal Article -
18
Catalytic P systems, semilinear sets, and vector addition systems
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
Parallel algorithms for fast computation of normalized edit distances
Published in Proceedings of SPDP '96: 8th IEEE Symposium on Parallel and Distributed Processing (1996)“…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
Naming symmetric processes using shared variables
Published in Distributed computing (01-08-1994)Get full text
Journal Article