Results 1  10
of
93,482
Randomized Gossip Algorithms
 IEEE TRANSACTIONS ON INFORMATION THEORY
, 2006
"... Motivated by applications to sensor, peertopeer, and ad hoc networks, we study distributed algorithms, also known as gossip algorithms, for exchanging information and for computing in an arbitrarily connected network of nodes. The topology of such networks changes continuously as new nodes join a ..."
Abstract

Cited by 517 (5 self)
 Add to MetaCart
distribute the computational burden and in which a node communicates with a randomly chosen neighbor. We analyze the averaging problem under the gossip constraint for an arbitrary network graph, and find that the averaging time of a gossip algorithm depends on the second largest eigenvalue of a doubly
Search and replication in unstructured peertopeer networks
, 2002
"... Abstract Decentralized and unstructured peertopeer networks such as Gnutella are attractive for certain applicationsbecause they require no centralized directories and no precise control over network topologies and data placement. However, the floodingbased query algorithm used in Gnutella does n ..."
Abstract

Cited by 674 (6 self)
 Add to MetaCart
propose a query algorithm based on multiple random walks that resolves queries almost as quickly as gnutella's flooding method while reducing the network traffic by two orders of magnitude in many cases. We also present a distributed replication strategy that yields closetooptimal performance
Random walks for image segmentation
 IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
, 2006
"... A novel method is proposed for performing multilabel, interactive image segmentation. Given a small number of pixels with userdefined (or predefined) labels, one can analytically and quickly determine the probability that a random walker starting at each unlabeled pixel will first reach one of the ..."
Abstract

Cited by 379 (21 self)
 Add to MetaCart
. This algorithm is formulated in discrete space (i.e., on a graph) using combinatorial analogues of standard operators and principles from continuous potential theory, allowing it to be applied in arbitrary dimension on arbitrary graphs.
Evolving Virtual Creatures
 in SIGGRAPH 94 Conference Proceedings, ser. Annual Conference Series
, 1994
"... This paper describes a novel system for creating virtual creatures that move and behave in simulated threedimensional physical worlds. The morphologies of creatures and the neural systems for controlling their muscle forces are both generated automatically using genetic algorithms. Different fitnes ..."
Abstract

Cited by 385 (1 self)
 Add to MetaCart
fitness evaluation functions are used to direct simulated evolutions towards specific behaviors such as swimming, walking, jumping, and following. A genetic language is presented that uses nodes and connections as its primitive elements to represent directed graphs, which are used to describe both
Walk and Learn: A TwoStage Approach for Opinion Words and Opinion Targets CoExtraction
"... This paper proposes a novel twostage method for opinion words and opinion targets coextraction. In the first stage, a Sentiment Graph Walking algorithm is proposed, which naturally incorporates syntactic patterns in a graph to extract opinion word/target candidates. In the second stage, we adopt a ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This paper proposes a novel twostage method for opinion words and opinion targets coextraction. In the first stage, a Sentiment Graph Walking algorithm is proposed, which naturally incorporates syntactic patterns in a graph to extract opinion word/target candidates. In the second stage, we adopt
SentiWordNet 3.0: An Enhanced Lexical Resource for Sentiment Analysis and Opinion Mining
 in Proc. of LREC
, 2010
"... In this work we present SENTIWORDNET 3.0, a lexical resource explicitly devised for supporting sentiment classification and opinion mining applications. SENTIWORDNET 3.0 is an improved version of SENTIWORDNET 1.0, a lexical resource publicly available for research purposes, now currently licensed to ..."
Abstract

Cited by 226 (6 self)
 Add to MetaCart
of WORDNET which they annotate (WORDNET 2.0 and 3.0, respectively), (b) in the algorithm used for automatically annotating WORDNET, which now includes (additionally to the previous semisupervised learning step) a randomwalk step for refining the scores. We here discuss SENTIWORDNET 3.0, especially
Computing communities in large networks using random walks
 J. of Graph Alg. and App. bf
, 2004
"... Dense subgraphs of sparse graphs (communities), which appear in most realworld complex networks, play an important role in many contexts. Computing them however is generally expensive. We propose here a measure of similarities between vertices based on random walks which has several important advan ..."
Abstract

Cited by 219 (3 self)
 Add to MetaCart
Dense subgraphs of sparse graphs (communities), which appear in most realworld complex networks, play an important role in many contexts. Computing them however is generally expensive. We propose here a measure of similarities between vertices based on random walks which has several important
Exponential Algorithmic Speedup by a Quantum Walk
"... We construct a black box graph traversal problem that can be solved exponentially faster on a quantum computer than on a classical computer. The quantum algorithm is based on a continuous time quantum walk, and thus employs a di#erent technique from previous quantum algorithms based on quantum Fouri ..."
Abstract

Cited by 155 (9 self)
 Add to MetaCart
We construct a black box graph traversal problem that can be solved exponentially faster on a quantum computer than on a classical computer. The quantum algorithm is based on a continuous time quantum walk, and thus employs a di#erent technique from previous quantum algorithms based on quantum
Mining Opinion Words and Opinion Targets in a TwoStage Framework
"... This paper proposes a novel twostage method for mining opinion words and opinion targets. In the first stage, we propose a Sentiment Graph Walking algorithm, which naturally incorporates syntactic patterns in a Sentiment Graph to extract opinion word/target candidates. Then random walking is employ ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
This paper proposes a novel twostage method for mining opinion words and opinion targets. In the first stage, we propose a Sentiment Graph Walking algorithm, which naturally incorporates syntactic patterns in a Sentiment Graph to extract opinion word/target candidates. Then random walking
Graph Ranking for Sentiment Transfer
"... With the aim to deal with sentimenttransfer problem, we proposed a novel approach, which integrates the sentiment orientations of documents into the graphranking algorithm. We apply the graphranking algorithm using the accurate labels of olddomain documents as well as the “pseudo ” labels of new ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
With the aim to deal with sentimenttransfer problem, we proposed a novel approach, which integrates the sentiment orientations of documents into the graphranking algorithm. We apply the graphranking algorithm using the accurate labels of olddomain documents as well as the “pseudo ” labels
Results 1  10
of
93,482