401 search results - page 79 / 81 » Sparse Quasi-Random Graphs |
123
Voted
ICNP
2006
IEEE
15 years 8 months 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 ...
127
Voted
INFOCOM
2006
IEEE
15 years 8 months 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...
137
Voted
SIGIR
2005
ACM
15 years 8 months 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...
133
Voted
CIKM
2005
Springer
15 years 8 months 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 ...
114
Voted
ECML
2005
Springer
15 years 8 months 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...