401 search results - page 79 / 81 » Sparse Quasi-Random Graphs |
171
Voted
ICNP
2006
IEEE
16 years 22 days ago
2006
IEEE
— Routing in multi-hop wireless networks involves the indirection from a persistent name (or ID) to a locator. Concepts such as coordinate space embedding help reduce the number ...
176
click to vote
INFOCOM
2006
IEEE
16 years 22 days ago
2006
IEEE
— In the standard approach to studying connectivity, a physical layer is assumed that allows direct transmission between neighbors within some fixed distance. The graph resultin...
195
click to vote
SIGIR
2005
ACM
16 years 8 days ago
2005
ACM
In this paper we use a Unified Relationship Matrix (URM) to represent a set of heterogeneous data objects (e.g., web pages, queries) and their interrelationships (e.g., hyperlinks...
196
Voted
CIKM
2005
Springer
16 years 7 days ago
2005
Springer
Can we use social networks to combat spam? This paper investigates the feasibility of MailRank, a new email ranking and classification scheme exploiting the social communication ...
167
click to vote
ECML
2005
Springer
16 years 7 days ago
2005
Springer
Spectral methods for embedding graphs and immersing data manifolds in low-dimensional speaces are notoriously unstable due to insufficient and/or numberically ill-conditioned con...