Sciweavers

44 search results - page 7 / 9
» Fast shortest path distance estimation in large networks
Sort
View
IJSNET
2006
170views more  IJSNET 2006»
13 years 7 months ago
Ordinal MDS-based localisation for wireless sensor networks
: There are various applications in wireless sensor networks which require knowing the relative or actual position of the sensor nodes. Over the past few years, there have been dif...
Vijayanth Vivekanandan, Vincent W. S. Wong
SIAMSC
2010
132views more  SIAMSC 2010»
13 years 2 months ago
Some Improvements for the Fast Sweeping Method
In this paper, we outline two improvements to the fast sweeping method to improve the speed of the method in general and more specifically in cases where the speed is changing rapi...
Stanley Bak, Joyce R. McLaughlin, Daniel Renzi
ICDM
2008
IEEE
222views Data Mining» more  ICDM 2008»
14 years 2 months ago
GRAPHITE: A Visual Query System for Large Graphs
We present Graphite, a system that allows the user to visually construct a query pattern, finds both its exact and approximate matching subgraphs in large attributed graphs, and ...
Duen Horng Chau, Christos Faloutsos, Hanghang Tong...
JCB
2002
108views more  JCB 2002»
13 years 7 months ago
Fast and Accurate Phylogeny Reconstruction Algorithms Based on the Minimum-Evolution Principle
This paper investigates the standard ordinary least-squares version 24 and the balanced version 20 of the minimum evolution principle. For the standard version, we provide a greedy...
Richard Desper, Olivier Gascuel
AAAI
2000
13 years 9 months ago
Collective Intelligence and Braess' Paradox
We consider the use of multi-agent systems to control network routing. Conventional approaches to this task are based on Ideal Shortest Path routing Algorithm (ISPA), under which ...
Kagan Tumer, David Wolpert