Sciweavers

459 search results - page 91 / 92
» A general model for clustering binary data
Sort
View
PPOPP
2005
ACM
13 years 10 months ago
Teleport messaging for distributed stream programs
In this paper, we develop a new language construct to address one of the pitfalls of parallel programming: precise handling of events across parallel components. The construct, te...
William Thies, Michal Karczmarek, Janis Sermulins,...
MM
2006
ACM
108views Multimedia» more  MM 2006»
13 years 11 months ago
Video search reranking via information bottleneck principle
We propose a novel and generic video/image reranking algorithm, IB reranking, which reorders results from text-only searches by discovering the salient visual patterns of relevant...
Winston H. Hsu, Lyndon S. Kennedy, Shih-Fu Chang
WWW
2009
ACM
14 years 5 months ago
Community gravity: measuring bidirectional effects by trust and rating on online social networks
Several attempts have been made to analyze customer behavior on online E-commerce sites. Some studies particularly emphasize the social networks of customers. Users' reviews ...
Yutaka Matsuo, Hikaru Yamamoto
SIGMOD
2008
ACM
191views Database» more  SIGMOD 2008»
14 years 5 months ago
Efficient aggregation for graph summarization
Graphs are widely used to model real world objects and their relationships, and large graph datasets are common in many application domains. To understand the underlying character...
Yuanyuan Tian, Richard A. Hankins, Jignesh M. Pate...
MOBIHOC
2007
ACM
14 years 4 months ago
Bounds for the capacity of wireless multihop networks imposed by topology and demand
Existing work on the capacity of wireless networks predominantly considers homogeneous random networks with random work load. The most relevant bounds on the network capacity, e.g...
Alireza Keshavarz-Haddad, Rudolf H. Riedi