Results 1  10
of
1,209
LSCs: Breathing Life into Message Sequence Charts
, 2001
"... While message sequence charts (MSCs) are widely used in industry to document the interworking of processes or objects, they are expressively weak, being based on the modest semantic notion of a partial ordering of events as defined, e.g., in the ITU standard. A highly expressive and rigorously defin ..."
Abstract

Cited by 444 (71 self)
 Add to MetaCart
While message sequence charts (MSCs) are widely used in industry to document the interworking of processes or objects, they are expressively weak, being based on the modest semantic notion of a partial ordering of events as defined, e.g., in the ITU standard. A highly expressive and rigorously
A distributed algorithm for minimumweight spanning trees
, 1983
"... A distributed algorithm is presented that constructs he minimumweight spanning tree in a connected undirected graph with distinct edge weights. A processor exists at each node of the graph, knowing initially only the weights of the adjacent edges. The processors obey the same algorithm and exchange ..."
Abstract

Cited by 435 (3 self)
 Add to MetaCart
A distributed algorithm is presented that constructs he minimumweight spanning tree in a connected undirected graph with distinct edge weights. A processor exists at each node of the graph, knowing initially only the weights of the adjacent edges. The processors obey the same algorithm
Aggregate and Verifiably Encrypted Signatures from Bilinear Maps
, 2002
"... An aggregate signature scheme is a digital signature that supports aggregation: Given n signatures on n distinct messages from n distinct users, it is possible to aggregate all these signatures into a single short signature. This single signature (and the n original messages) will convince the verif ..."
Abstract

Cited by 336 (12 self)
 Add to MetaCart
An aggregate signature scheme is a digital signature that supports aggregation: Given n signatures on n distinct messages from n distinct users, it is possible to aggregate all these signatures into a single short signature. This single signature (and the n original messages) will convince
Sharing the Cost of Multicast Transmissions
, 2001
"... We investigate costsharing algorithms for multicast transmission. Economic considerations point to two distinct mechanisms, marginal cost and Shapley value, as the two solutions most appropriate in this context. We prove that the former has a natural algorithm that uses only two messages per link o ..."
Abstract

Cited by 284 (16 self)
 Add to MetaCart
We investigate costsharing algorithms for multicast transmission. Economic considerations point to two distinct mechanisms, marginal cost and Shapley value, as the two solutions most appropriate in this context. We prove that the former has a natural algorithm that uses only two messages per link
MAP estimation via agreement on trees: Messagepassing and linear programming
, 2002
"... We develop and analyze methods for computing provably optimal maximum a posteriori (MAP) configurations for a subclass of Markov random fields defined on graphs with cycles. By decomposing the original distribution into a convex combination of treestructured distributions, we obtain an upper bound ..."
Abstract

Cited by 191 (9 self)
 Add to MetaCart
product messagepassing algorithm that is related to but distinct from the maxproduct algorithm. In this way, we establish a connection between a certain LP relaxation of the modefinding problem, and a reweighted form of the maxproduct (minsum) messagepassing algorithm.
Topic and role discovery in social networks
 In IJCAI
, 2005
"... Previous work in social network analysis (SNA) has modeled the existence of links from one entity to another, but not the language content or topics on those links. We present the AuthorRecipientTopic (ART) model for social network analysis, which learns topic distributions based on the direction ..."
Abstract

Cited by 221 (15 self)
 Add to MetaCart
sensitive messages sent between entities. The model builds on Latent Dirichlet Allocation (LDA) and the AuthorTopic (AT) model, adding the key attribute that distribution over topics is conditioned distinctly on both the sender and recipient—steering the discovery of topics according to the relationships between
A Few Chirps About Twitter
"... Web 2.0 has brought about several new applications that have enabled arbitrary subsets of users to communicate with each other on a social basis. Such communication increasingly happens not just on Facebook and MySpace but on several smaller network applications such as Twitter and Dodgeball. We pre ..."
Abstract

Cited by 215 (5 self)
 Add to MetaCart
present a detailed characterization of Twitter, an application that allows users to send short messages. We gathered three datasets (covering nearly 100,000 users) including constrained crawls of the Twitter network using two different methodologies, and a sampled collection from the publicly available
The Character, Functions, and Styles of Instant Messaging in the Workplace
, 2002
"... Current perceptions of Instant Messaging (IM) use are based primarily on selfreport studies. We logged thousands of (mostly) workplace IM conversations and evaluated their conversational characteristics and functions. Contrary to prior research, we found that the primary use of workplace IM was for ..."
Abstract

Cited by 117 (1 self)
 Add to MetaCart
Current perceptions of Instant Messaging (IM) use are based primarily on selfreport studies. We logged thousands of (mostly) workplace IM conversations and evaluated their conversational characteristics and functions. Contrary to prior research, we found that the primary use of workplace IM
Crafting normative messages to protect the environment
 Current Directions in Psychological Science
, 2003
"... It is widely recognized that communications that activate social norms can be effective in producing societally beneficial conduct. Not so well recognized are the circumstances under which normative information can backfire to produce the opposite of what a communicator intends. There is an understa ..."
Abstract

Cited by 98 (3 self)
 Add to MetaCart
are spoiling the environment. Although these claims may be both true and well intentioned, the campaigns ’ creators have missed something critically important: Within the statement “Many people are doing this undesirable thing ” lurks the powerful and undercutting normative message “Many people are doing this
MAP estimation via agreement on (hyper)trees: Messagepassing and linear programming approaches
 IEEE Transactions on Information Theory
, 2002
"... We develop an approach for computing provably exact maximum a posteriori (MAP) configurations for a subclass of problems on graphs with cycles. By decomposing the original problem into a convex combination of treestructured problems, we obtain an upper bound on the optimal value of the original ..."
Abstract

Cited by 147 (10 self)
 Add to MetaCart
configuration must also be a MAP configuration for the original problem. Next we present and analyze two methods for attempting to obtain tight upper bounds: (a) a treereweighted messagepassing algorithm that is related to but distinct from the maxproduct (minsum) algorithm; and (b) a treerelaxed linear
Results 1  10
of
1,209