Sciweavers

1282 search results - page 150 / 257
» Algorithms for Large, Sparse Network Alignment Problems
Sort
View
ISCAPDCS
2003
15 years 5 months ago
Design and Analysis of Improved Shortest Path Tree Update for Network Routing
The quick construction of the Shortest Path Tree (SPT) is essential to achieve fast routing speed for an interior network using link state protocols, such as OSPF and IS-IS. Whene...
Bin Xiao, Qingfeng Zhuge, Zili Shao, Edwin Hsing-M...
CVPR
2009
IEEE
16 years 11 months ago
Monitoring, Recognizing and Discovering Social Networks
This work addresses the important problem of the discovery and analysis of social networks from surveillance video. A computer vision approach to this problem is made possible b...
Ting Yu, Ser Nam Lim, Kedar A. Patwardhan, Nils Kr...
VTC
2006
IEEE
138views Communications» more  VTC 2006»
15 years 10 months ago
Simulated Annealing based Wireless Sensor Network Localization with Flip Ambiguity Mitigation
Abstract— Accurate self-localization capability is highly desirable in wireless sensor networks. A major problem in wireless sensor network localization is the flip ambiguity, w...
Anushiya A. Kannan, Guoqiang Mao, Branka Vucetic
121
Voted
SIGCOMM
1999
ACM
15 years 8 months ago
On Estimating End-to-End Network Path Properties
The more information about current network conditions available to a transport protocol, the more efficiently it can use the network to transfer its data. In networks such as the...
Mark Allman, Vern Paxson
133
Voted
RECOMB
2007
Springer
16 years 4 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...