Sciweavers

5451 search results - page 104 / 1091
» On very high degrees
Sort
View
95
Voted
ICS
2010
Tsinghua U.
15 years 10 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
RECOMB
2005
Springer
16 years 1 months ago
Improved Duplication Models for Proteome Network Evolution
Protein-protein interaction networks, particularly that of the yeast S. Cerevisiae, have recently been studied extensively. These networks seem to satisfy the small world property ...
Gürkan Bebek, Petra Berenbrink, Colin Cooper,...
90
Voted
SACRYPT
2005
Springer
112views Cryptology» more  SACRYPT 2005»
15 years 6 months ago
Pairing-Friendly Elliptic Curves of Prime Order
Previously known techniques to construct pairing-friendly curves of prime or near-prime order are restricted to embedding degree k 6. More general methods produce curves over Fp wh...
Paulo S. L. M. Barreto, Michael Naehrig
84
Voted
ICRA
1999
IEEE
119views Robotics» more  ICRA 1999»
15 years 5 months ago
Development of a Visual Space-Mouse
The pervasiveness of computers in everyday life coupled with recent rapid advances in computer technology have created both the need and the means for sophisticated Human Computer...
Tobias Peter Kurpjuhn, Alexa Hauck, Kevin Nickels,...
GLOBECOM
2006
IEEE
15 years 6 months ago
Enhancements for RTT-Fair HighSpeed TCP
— TCP is known to have bandwidth fairness problems for flows of different RTT. HighSpeed TCP, which adapts TCP’s congestion avoidance to grow faster, and thus be able to scale...
Damien Phillips, Jiankun Hu