Sciweavers

2842 search results - page 255 / 569
» Expansion and Search in Networks
Sort
View
HOTOS
2007
IEEE
15 years 10 months ago
Hyperspaces for Object Clustering and Approximate Matching in Peer-to-Peer Overlays
Existing distributed hash tables provide efficient mechanisms for storing and retrieving a data item based on an exact key, but are unsuitable when the search key is similar, but ...
Bernard Wong, Ymir Vigfusson, Emin Gün Sirer
200
Voted
ICDE
2010
IEEE
240views Database» more  ICDE 2010»
15 years 11 months ago
Top-K aggregation queries over large networks
Searching and mining large graphs today is critical to a variety of application domains, ranging from personalized recommendation in social networks, to searches for functional ass...
Xifeng Yan, Bin He, Feida Zhu, Jiawei Han
ISAAC
2007
Springer
102views Algorithms» more  ISAAC 2007»
16 years 24 days ago
Depth of Field and Cautious-Greedy Routing in Social Networks
Social networks support efficient decentralized search: people can collectively construct short paths to a specified target in the network. Rank-based friendship—where the prob...
David Barbella, George Kachergis, David Liben-Nowe...
197
Voted
PERCOM
2010
ACM
15 years 5 months ago
Sensor.Network: An open data exchange for the web of things
Abstract—Tiny, wireless, sensors embedded in a large number of Internet-capable devices–smart phones, cameras, cars, toys, medical instruments, home appliances and energy meter...
Vipul Gupta, Arshan Poursohi, Poornaprajna Udupi
SIGIR
2011
ACM
14 years 9 months ago
Mining tags using social endorsement networks
Entities on social systems, such as users on Twitter, and images on Flickr, are at the core of many interesting applications: they can be ranked in search results, recommended to ...
Theodoros Lappas, Kunal Punera, Tamás Sarlo...