Sciweavers

1941 search results - page 52 / 389
» On Generalizations of Network Design Problems with Degree Bo...
Sort
View
CORR
2010
Springer
111views Education» more  CORR 2010»
14 years 10 months ago
Improved complexity bounds for real root isolation using Continued Fractions
We consider the problem of isolating the real roots of a square-free polynomial with integer coefficients using (variants of) the continued fraction algorithm (CF). We introduce a...
Elias P. Tsigaridas
ICS
2010
Tsinghua U.
15 years 7 months ago
Local Algorithms for Finding Interesting Individuals in Large Networks
: We initiate the study of local, sublinear time algorithms for finding vertices with extreme topological properties -- such as high degree or clustering coefficient -- in large so...
Mickey Brautbar, Michael Kearns
KDD
2010
ACM
235views Data Mining» more  KDD 2010»
15 years 1 months ago
New perspectives and methods in link prediction
This paper examines important factors for link prediction in networks and provides a general, high-performance framework for the prediction task. Link prediction in sparse network...
Ryan Lichtenwalter, Jake T. Lussier, Nitesh V. Cha...
ICOIN
2005
Springer
15 years 3 months ago
On the Hidden Terminal Problem in Multi-rate Ad Hoc Wireless Networks
Multi-hop ad hoc wireless networks generally use the IEEE 802.11 Distributed Coordination Function (DCF) MAC protocol, which utilizes the request-to-send/clear-to-send (RTS/CTS) me...
Joon Yoo, Chongkwon Kim
INFOCOM
2007
IEEE
15 years 4 months ago
The Power Balancing Problem in Energy Constrained Multi-Hop Wireless Networks
— Power efficient operation is very critical in energy constrained multi-hop wireless networks. One important technique is to intelligently assign transmission powers to nodes w...
Randeep Bhatia, Abhishek Kashyap, Erran L. Li