Sciweavers

1101 search results - page 45 / 221
» An Algorithm for the Graph Crossing Number Problem
Sort
View
CIDM
2009
IEEE
15 years 5 months ago
Empirical comparison of graph classification algorithms
The graph classification problem is learning to classify separate, individual graphs in a graph database into two or more categories. A number of algorithms have been introduced fo...
Nikhil S. Ketkar, Lawrence B. Holder, Diane J. Coo...
CCCG
2008
15 years 3 months ago
A Distributed Algorithm for Computing Voronoi Diagram in the Unit Disk Graph Model
We study the problem of computing Voronoi diagrams distributedly for a set of nodes of a network modeled as a Unit Disk Graph (UDG). We present an algorithm to solve this problem ...
Yurai Núñez Rodríguez, Henry ...
COCOA
2008
Springer
15 years 3 months ago
Elementary Approximation Algorithms for Prize Collecting Steiner Tree Problems
This paper deals with approximation algorithms for the prize collecting generalized Steiner forest problem, defined as follows. The input is an undirected graph G = (V, E), a colle...
Shai Gutner
VTC
2008
IEEE
239views Communications» more  VTC 2008»
15 years 8 months ago
Cross-Layer and Path Priority Scheduling Based Real-Time Video Communications over Wireless Sensor Networks
—This paper addresses the problem of real-time video streaming over a bandwidth and energy constrained wireless sensor network (WSN). Considering the compressed video bit stream ...
Min Chen, Victor C. M. Leung, Shiwen Mao, Ming Li
IPPS
1998
IEEE
15 years 6 months ago
NC Algorithms for the Single Most Vital Edge Problem with Respect to All Pairs Shortest Paths
For a weighted, undirected graph G = V;E where jVj = n and jEj = m, we examine the single most vital edge with respect to two measurements related to all-pairs shortest paths APSP....
Sven Venema, Hong Shen, Francis Suraweera