Sciweavers

268 search results - page 51 / 54
» Finding the k Shortest Paths
Sort
View
CORR
2004
Springer
119views Education» more  CORR 2004»
13 years 7 months ago
Exploring networks with traceroute-like probes: theory and simulations
Mapping the Internet generally consists in sampling the network from a limited set of sources by using traceroute-like probes. This methodology, akin to the merging of different s...
Luca Dall'Asta, J. Ignacio Alvarez-Hamelin, Alain ...
INFOCOM
2010
IEEE
13 years 5 months ago
Green Wave: Latency and Capacity-Efficient Sleep Scheduling for Wireless Networks
While scheduling the nodes in a wireless network to sleep periodically can save energy, it also incurs higher latency and lower throughput. We consider the problem of designing op...
Saikat Guha, Chi-Kin Chau, Prithwish Basu
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
ICDE
2011
IEEE
240views Database» more  ICDE 2011»
12 years 11 months ago
Similarity measures for multidimensional data
— How similar are two data-cubes? In other words, the question under consideration is: given two sets of points in a multidimensional hierarchical space, what is the distance val...
Eftychia Baikousi, Georgios Rogkakos, Panos Vassil...
CPM
1993
Springer
154views Combinatorics» more  CPM 1993»
13 years 11 months ago
On Suboptimal Alignments of Biological Sequences
It is widely accepted that the optimal alignment between a pair of proteins or nucleic acid sequences that minimizes the edit distance may not necessarily re ect the correct biolog...
Dalit Naor, Douglas L. Brutlag