Sciweavers

1101 search results - page 171 / 221
» An Algorithm for the Graph Crossing Number Problem
Sort
View
CISS
2008
IEEE
15 years 2 months ago
Detection of anomalous meetings in a social network
Abstract-- When monitoring interactions within a social network, meetings or contacts between different members of the network are recorded. This paper addresses the problem of usi...
Jorge Silva, Rebecca Willett
DIALM
2007
ACM
110views Algorithms» more  DIALM 2007»
15 years 5 months ago
SDP-based Approach for Channel Assignment in Multi-radio Wireless Networks
We consider the following channel assignment problem in multiradio multi-channel wireless networks: Given a wireless network where k orthogonal channels are available and each nod...
Hieu Dinh, Yoo Ah Kim, Seungjoon Lee, Minho Shin, ...
CIKM
2007
Springer
15 years 8 months ago
RDF data exploration and visualization
We present Paged Graph Visualization (PGV), a new semiautonomous tool for RDF data exploration and visualization. PGV consists of two main components: a) the “PGV explorer” an...
Leonidas Deligiannidis, Krys Kochut, Amit P. Sheth
COMCOM
2004
108views more  COMCOM 2004»
15 years 1 months ago
Dynamic establishment of differentiated survivable lightpaths in WDM mesh networks
In the emerging next-generation transport networks, called intelligent optical transport networks, DWDM-based optical components like add-drop multiplexers and optical cross conne...
Chava Vijaya Saradhi, C. Siva Ram Murthy
CVPR
2010
IEEE
15 years 10 months ago
Parallel Graph-cuts by Adaptive Bottom-up Merging
Graph-cuts optimization is prevalent in vision and graphics problems. It is thus of great practical importance to parallelize the graph-cuts optimization using today’s ubiquitou...
Jiangyu Liu, Jian Sun