Sciweavers

774 search results - page 119 / 155
» Factors of generalized Fermat numbers
Sort
View
32
Voted
WWW
2007
ACM
14 years 10 months ago
Expertise networks in online communities: structure and algorithms
Web-based communities have become important places for people to seek and share expertise. We find that networks in these communities typically differ in their topology from other...
Jun Zhang, Mark S. Ackerman, Lada A. Adamic
WWW
2003
ACM
14 years 10 months ago
SHOCK: communicating with computational messages and automatic private profiles
A computationally enhanced message contains some embedded programmatic components that are interpreted and executed automatically upon receipt. Unlike ordinary text email or insta...
Rajan M. Lukose, Eytan Adar, Joshua R. Tyler, Caes...
WWW
2003
ACM
14 years 10 months ago
A Unified Abstraction for Messaging on the Semantic Web
d Abstraction for Messaging on the Semantic Web Dennis Quan IBM Internet Technology 1 Rogers Street Cambridge, MA 02142 USA dennisq@us.ibm.com Karun Bakshi MIT Artificial Intellige...
Dennis Quan, Karun Bakshi, David R. Karger
KDD
2009
ACM
167views Data Mining» more  KDD 2009»
14 years 10 months ago
SNARE: a link analytic system for graph labeling and risk detection
Classifying nodes in networks is a task with a wide range of applications. It can be particularly useful in anomaly and fraud detection. Many resources are invested in the task of...
Mary McGlohon, Stephen Bay, Markus G. Anderle, Dav...
STOC
2006
ACM
174views Algorithms» more  STOC 2006»
14 years 10 months ago
Edge-disjoint paths in Planar graphs with constant congestion
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs s1t1, s2t2, . . ., sktk, the goal is to maximize the number of pairs t...
Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd