Sciweavers

6251 search results - page 139 / 1251
» Randomness, Computability, and Density
Sort
View
CORR
2007
Springer
115views Education» more  CORR 2007»
15 years 3 months ago
FPRAS for computing a lower bound for weighted matching polynomial of graphs
We give a fully polynomial randomized approximation scheme to compute a lower bound for the matching polynomial of any weighted graph at a positive argument. For the matching poly...
Shmuel Friedland
136
Voted
CN
2000
92views more  CN 2000»
15 years 3 months ago
What is this page known for? Computing Web page reputations
The textual content of the Web enriched with the hyperlink structure surrounding it can be a useful source of information for querying and searching. This paper presents a search ...
Davood Rafiei, Alberto O. Mendelzon
GLOBECOM
2009
IEEE
15 years 10 months ago
Carrier to Interference Ratio Analysis for the Shotgun Cellular System
—This paper analyzes the carrier-to-interference ratio of the so-called shotgun cellular system (SCS). In the SCS, basestations are placed randomly according to a two-dimensional...
Prasanna Madhusudhanan, Juan G. Restrepo, Youjian ...
141
Voted
ICWN
2003
15 years 5 months ago
Performance of Mobile Ad Hoc Network in Constrained Mobility Pattern
Mobile Ad Hoc Networks (MANET) performance is affected by a number of factors, eg. speed, node density. In this paper we will focus on the effect of constrained mobility on the per...
Bu-Sung Lee, Kai Juan Wong, Boon-Chong Seet, Lijua...
CORR
2006
Springer
109views Education» more  CORR 2006»
15 years 3 months ago
Hierarchical Cooperation Achieves Optimal Capacity Scaling in Ad Hoc Networks
n source and destination pairs randomly located in an area want to communicate with each other. Signals transmitted from one user to another at distance r apart are subject to a po...
Ayfer Özgür, Olivier Lévêqu...