Sciweavers

1162 search results - page 61 / 233
» Minimum Cycle Bases in Graphs Algorithms and Applications
Sort
View
NETWORKING
2007
13 years 9 months ago
Interference-Aware Multicasting in Wireless Mesh Networks
Multicasting is one of the most important applications in Wireless Ad hoc Networks and the currently emerging Wireless Mesh Networks. In such networks, interference due to the shar...
Sudheendra Murthy, Abhishek Goswami, Arunabha Sen
CAD
2007
Springer
13 years 8 months ago
Detection of closed sharp edges in point clouds using normal estimation and graph theory
The reconstruction of a surface model from a point cloud is an important task in the reverse engineering of industrial parts. We aim at constructing a curve network on the point c...
Kris Demarsin, Denis Vanderstraeten, Tim Volodine,...
APPROX
2004
Springer
136views Algorithms» more  APPROX 2004»
14 years 1 months ago
On the Crossing Spanning Tree Problem
Given an undirected n-node graph and a set C of m cuts, the minimum crossing tree is a spanning tree which minimizes the maximum crossing of any cut in C, where the crossing of a c...
Vittorio Bilò, Vineet Goyal, R. Ravi, Mohit...
TIP
2010
155views more  TIP 2010»
13 years 6 months ago
Laplacian Regularized D-Optimal Design for Active Learning and Its Application to Image Retrieval
—In increasingly many cases of interest in computer vision and pattern recognition, one is often confronted with the situation where data size is very large. Usually, the labels ...
Xiaofei He
ADHOCNOW
2009
Springer
13 years 6 months ago
A Decentralized Approach to Minimum-Energy Broadcasting in Static Ad Hoc Networks
Broadcasting is a commonly used feature in wireless networking, e.g. for file distribution, re-tasking, event notification, or miscellaneous maintenance. Due to the limited resourc...
Christopher Miller, Christian Poellabauer