Finding the similarity between paths is an important problem that comes up in many areas such as 3D modeling, GIS applications, ordering, and reachability. Given a set of points S, a polygonal curve P , and an ε > 0, the discrete set-chain matching problem is to find another polygonal curve Q such that the nodes of Q are points in S and dF (P,Q) ≤ ε. Here, dF is the discrete Fréchet distance be...

Nonlinear Knapsack Problems (NKP) are the alternative formulation for the multiple-choice knapsack problems. A powerful approach for solving NKP is dynamic programming which may obtain the global op-timal solution even in the case of discrete solution space for these problems. Despite the power of this solu-tion approach, it computationally performs very slowly when the solution space of the pr...

We consider the problem of finding minimum-cost time-varying subgraphs that can deliver continuous service to dynamic multicast groups in coded networks (i.e. networks that use network coding). This problem is relevant for applications such as real-time media distribution. We formulate the problem within the framework of dynamic programming and apply dynamic programming theory to suggest how it...

bioinformatics, through the sequencing of the full genomes for many species, is increasingly relying on efficient global alignment tools exhibiting both high sensitivity and specificity. many computational algorithms have been applied for solving the sequence alignment problem. dynamic programming, statistical methods, approximation and heuristic algorithms are the most common methods applied t...

This paper evaluates the performance of a context discovery protocol using attenuated Bloom filters while nodes appear, disappear, and are temporary unreachable in ad-hoc networks through analytical analysis. Further we verified obtained results with simulation analysis. The analytical results are most accurate when node density is high. Further, we discover that adding a node generates less tr...

As sensor networks become increasingly ubiquitous, we envision an instrumented environment that can provide varying amounts of information to mobile applications immersed within the network. Such a scenario deviates from existing deployments of sensor networks which are often highly application-specific and generally funnel information to a central collection service for a single purpose. Inste...

To my beloved wife Fatma for her patience, encouragement, and support and To my daughter Ayse and son Omer. ii ACKNOWLEDGMENTS First and foremost, I would like to express my special gratitude to my advisor Dr. support over the past four years. He made the last four tough years of my Ph.D. studies and research fun with his friendship and humor. I am deeply grateful to him for always being there ...