675 search results - page 4 / 135 » Algorithms for estimating relative importance in networks |
ICASSP
2011
IEEE
12 years 10 months ago
2011
IEEE
Recently, the maximum likelihood estimator (MLE) and Cramer-Rao Lower Bound (CRLB) were proposed with the goal of maximizing and assessing the synchronization accuracy in wireless...
INFOCOM
2002
IEEE
13 years 12 months ago
2002
IEEE
Abstract—Packet delay traces are important measurements for analyzing end-to-end performance and for designing traffic control algorithms in computer networks. Due to the fact t...
AIME
2005
Springer
13 years 9 months ago
2005
Springer
In recent years, a few researchers have challenged past dogma and suggested methods (such as the IC algorithm) for inferring causal relationship among variables using steady state ...
BMCBI
2008
13 years 7 months ago
2008
Background: Graph analysis algorithms such as PageRank and HITS have been successful in Web environments because they are able to extract important inter-document relationships fr...
WWW
2010
ACM
14 years 1 months ago
2010
ACM
Extracting semantic relations among entities is an important first step in various tasks in Web mining and natural language processing such as information extraction, relation de...