Sciweavers

13214 search results - page 2481 / 2643
» Pseudorandomness for network algorithms
Sort
View
SIGCOMM
2010
ACM
15 years 6 months ago
Achieving O(1) IP lookup on GPU-based software routers
IP address lookup is a challenging problem due to the increasing routing table size, and higher line rate. This paper investigates a new way to build an efficient IP lookup scheme...
Jin Zhao, Xinya Zhang, Xin Wang, Xiangyang Xue
ICASSP
2010
IEEE
15 years 6 months ago
A convex relaxation for approximate maximum-likelihood 2D source localization from range measurements
This paper addresses the problem of locating a single source from noisy range measurements in wireless sensor networks. An approximate solution to the maximum likelihood location ...
Pinar Oguz-Ekim, João Pedro Gomes, Jo&atild...
ICASSP
2010
IEEE
15 years 6 months ago
Distributed bearing estimation via matrix completion
We consider bearing estimation of multiple narrow-band plane waves impinging on an array of sensors. For this problem, bearing estimation algorithms such as minimum variance disto...
Andrew Waters, Volkan Cevher
CCGRID
2008
IEEE
15 years 6 months ago
Fault Tolerance and Recovery of Scientific Workflows on Computational Grids
In this paper, we describe the design and implementation of two mechanisms for fault-tolerance and recovery for complex scientific workflows on computational grids. We present our ...
Gopi Kandaswamy, Anirban Mandal, Daniel A. Reed
BMCBI
2007
107views more  BMCBI 2007»
15 years 6 months ago
Progressive multiple sequence alignments from triplets
Motivation: The quality of progressive sequence alignments strongly depends on the accuracy of the individual pairwise alignment steps since gaps that are introduced at one step c...
Matthias Kruspe, Peter F. Stadler
« Prev « First page 2481 / 2643 Last » Next »