2127 search results - page 171 / 426 » Computing large matchings fast |
133
click to vote
ICNP
2005
IEEE
15 years 9 months ago
2005
IEEE
In this paper, we introduce Z-Ring, a fast prefix routing protocol for peer-to-peer overlay networks. Z-Ring incorporates cost-efficient membership protocol to achieve fast routin...
161
click to vote
CIKM
2010
Springer
15 years 2 months ago
2010
Springer
This paper proposes an algorithm called Imprecise Spectrum Analysis (ISA) to carry out fast dimension reduction for document classification. ISA is designed based on the one-sided...
171
click to vote
UIST
2010
ACM
15 years 2 months ago
2010
ACM
Modern mobile phones can store a large amount of data, such as contacts, applications and music. However, it is difficult to access specific data items via existing mobile user in...
138
click to vote
PAIRING
2009
Springer
15 years 10 months ago
2009
Springer
When using pairing-friendly ordinary elliptic curves over prime fields to implement identity-based protocols, there is often a need to hash identities to points on one or both of ...
182
click to vote
ICDM
2006
IEEE
15 years 10 months ago
2006
IEEE
How closely related are two nodes in a graph? How to compute this score quickly, on huge, disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance scor...