Ara
Toplam kayıt 10, listelenen: 1-10
Crossing minimization in weighted bipartite graphs
(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. ...
Colored simultaneous geometric embeddings and universal pointsets
(Springer, 2011-07)
Universal pointsets can be used for visualizing multiple relationships on the same set of objects or for visualizing dynamic graph processes. In simultaneous geometric embeddings, the same point in the plane is used to ...
A robust biclustering method based on crossing minimization in bipartite graphs
(Springer-Verlag Berlin, 2009)
[No abstract available]
Force-directed approaches to sensor localization
(Assoc Computing Machinery, 2010-09)
As the number of applications of sensor networks increases, so does the interest in sensor network localization, that is, in recovering the correct position of each node in a network of sensors from partial connectivity ...
Force-directed approaches to sensor localization
(SIAM, 2006)
We consider the centralized, anchor-free sensor localization problem. We consider the case where the sensor network reports range information and the case where in addition to the range, we also have angular information ...
A robust localization framework to handle noisy measurements in wireless sensor networks
(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 ...
Fully decentralized, collaborative multilateration primitives for uniquely localizing WSNs
(Springer-Verlag Berlin, 2009)
We provide primitives for uniquely localizing WSN nodes. The goal is to maximize the number of uniquely localized nodes assuming a fully decentralized model of computation. Each node constructs a cluster of its own and ...
Colored simultaneous geometric embeddings
(Springer-Verlag Berlin, 2007)
We introduce the concept of colored simultaneous geometric embeddings as a generalization of simultaneous graph embeddings with and without mapping. We show that there exists a universal pointset of size n for paths colored ...
GSPIM: Graphical visualization tool for MIPS assembly programming and simulation
(2007)
We describe our system, GSPIM, used for visualization of low-level MIPS Assembly programming and simulation. Although many visualization tools for algorithms and high-level programs have been considered in educational ...
Biclustering expression data based on expanding localized substructures
(Springer-Verlag Berlin Heidelberg, 2009)
Biclustering gene expression data is the problem of extracting submatrices of genes and conditions exhibiting significant correlation across both the rows and the columns of a data matrix of expression values. We provide ...