Yazar "Karataş, Ömer" için listeleme
-
Crossing minimization in weighted bipartite graphs
Çakıroğlu, Olca Arda; Erten, Cesim; Karataş, Ömer; Sözdinler, Melih (Springer, 2007)Given a bipartite graph G = (L-0, L-1, E) and a fixed ordering of the nodes in L-0, the problem of finding an ordering of the nodes in L-1 that minimizes the number of crossings has received much attention in literature. ... -
Crossing minimization in weighted bipartite graphs
Çakıroğlu, Olca Arda; Erten, Cesim; Karataş, Ömer; Sözdinler, Melih (Elsevier B.V., 2009-12)Given a bipartite graph G = (L0, L1, E) and a fixed ordering of the nodes in L0, the problem of finding an ordering of the nodes in L1 that minimizes the number of crossings has received much attention in literature. The ... -
Robust localization framework for wireless sensor networks
Karataş, Ömer (Işık Üniversitesi, 2009-01-07)In this thesis we try to construct a robust localization framework for wireless sensor networks and sample algorithms which uses our robust localization framework. In order to handle noise in distance measurements, our ... -
A robust localization framework to handle noisy measurements in wireless sensor networks
Erten, Cesim; Karataş, Ömer (IEEE, 2009-09-14)We construct a robust localization framework to handle noisy measurements in wireless sensor networks. Traditionally many approaches employ the distance information gathered from ranging devices of the sensor nodes to ...