Sciweavers

1015 search results - page 183 / 203
» An efficient algorithm for AS path inferring
Sort
View
RECOMB
2007
Springer
14 years 8 months ago
QNet: A Tool for Querying Protein Interaction Networks
Molecular interaction databases can be used to study the evolution of molecular pathways across species. Querying such pathways is a challenging computational problem, and recent e...
Banu Dost, Tomer Shlomi, Nitin Gupta 0002, Eytan R...
EDBT
2006
ACM
159views Database» more  EDBT 2006»
14 years 8 months ago
Fast Nearest Neighbor Search on Road Networks
Nearest neighbor (NN) queries have been extended from Euclidean spaces to road networks. Existing approaches are either based on Dijkstra-like network expansion or NN/distance prec...
Haibo Hu, Dik Lun Lee, Jianliang Xu
PERCOM
2006
ACM
14 years 7 months ago
Resource Allocation in Wireless Networks Using Directional Antennas
With the continued increase of speed and capacities of computing devices and the growing needs of people for mobile computing capabilities, Mobile ad hoc networks (MANETs) have gai...
Imad Jawhar, Jie Wu
DCC
2000
IEEE
14 years 13 days ago
Channel Decoding Using Inter- and Intra-Correlation of Source Encoded Frames
The goal of source controlled channel decoding is to improve the performance of the channel decoder by using the residual redundancy of the source encoded data. The original appro...
Christophe Veaux, Pascal Scalart, André Gil...
FOCS
1999
IEEE
14 years 9 days ago
The Directed Steiner Network Problem is Tractable for a Constant Number of Terminals
We consider the DIRECTED STEINER NETWORK problem, also called the POINT-TO-POINT CONNECTION problem, where given a directed graph G and p pairs {(s1,t1),...,(sp,tp)} of nodes in t...
Jon Feldman, Matthias Ruhl