Sciweavers

1502 search results - page 31 / 301
» Node weighted scheduling
Sort
View
ICON
2007
IEEE
14 years 4 months ago
Node Localisation in Wireless Ad Hoc Networks
— Wireless ad hoc networks often require a method for estimating their nodes’ locations. Typically this is achieved by the use of pair-wise measurements between nodes and their...
Jon Arnold, Nigel Bean, Miro Kraetzl, Matthew Roug...
CVPR
2010
IEEE
14 years 1 months ago
Lymph Node Detection in 3-D Chest CT using a Spatial Prior Probability
Lymph nodes have high clinical relevance but detection is challenging as they are hard to see due to low contrast and irregular shape. In this paper, a method for fully automatic ...
Johannes Feulner, Kevin Zhou, Martin Huber, Joachi...
MP
1998
117views more  MP 1998»
13 years 9 months ago
The node capacitated graph partitioning problem: A computational study
In this paper we consider the problem of ^-partitioning the nodes of a graph with capacity restrictions on the sum of the node weights in each subset of the partition, and the obje...
Carlos Eduardo Ferreira, Alexander Martin, C. Carv...
WEBI
2005
Springer
14 years 3 months ago
A Novel Way of Computing Similarities between Nodes of a Graph, with Application to Collaborative Recommendation
This work presents a new perspective on characterizing the similarity between elements of a database or, more generally, nodes of a weighted, undirected, graph. It is based on a M...
François Fouss, Alain Pirotte, Marco Saeren...
PODC
2003
ACM
14 years 3 months ago
Compact roundtrip routing with topology-independent node names
This paper presents compact roundtrip routing schemes with local tables of size ˜O( √ n) and stretch 6 for any directed network with arbitrary edge weights; and with local tabl...
Marta Arias, Lenore Cowen, Kofi A. Laing