Results 1  10
of
3,369
Muscle: multiple sequence alignment with high accuracy and high throughput
 NUCLEIC ACIDS RES
, 2004
"... We describe MUSCLE, a new computer program for creating multiple alignments of protein sequences. Elements of the algorithm include fast distance estimation using kmer counting, progressive alignment using a new profile function we call the logexpectation score, and refinement using treedependent r ..."
Abstract

Cited by 2509 (7 self)
 Add to MetaCart
We describe MUSCLE, a new computer program for creating multiple alignments of protein sequences. Elements of the algorithm include fast distance estimation using kmer counting, progressive alignment using a new profile function we call the logexpectation score, and refinement using tree
Robust wide baseline stereo from maximally stable extremal regions
 In Proc. BMVC
, 2002
"... The widebaseline stereo problem, i.e. the problem of establishing correspondences between a pair of images taken from different viewpoints is studied. A new set of image elements that are put into correspondence, the so called extremal regions, is introduced. Extremal regions possess highly desir ..."
Abstract

Cited by 1016 (35 self)
 Add to MetaCart
sirable properties: the set is closed under 1. continuous (and thus projective) transformation of image coordinates and 2. monotonic transformation of image intensities. An efficient (near linear complexity) and practically fast detection algorithm (near frame rate) is presented for an affinelyinvariant stable
A new diamond search algorithm for fast block matching motion estimation
 in Proc. Int. Conf. Inform., Commun., Signal Process
, 1997
"... Abstract—Based on the study of motion vector distribution from several commonly used test image sequences, a new diamond search (DS) algorithm for fast blockmatching motion estimation (BMME) is proposed in this paper. Simulation results demonstrate that the proposed DS algorithm greatly outperforms ..."
Abstract

Cited by 268 (1 self)
 Add to MetaCart
Abstract—Based on the study of motion vector distribution from several commonly used test image sequences, a new diamond search (DS) algorithm for fast blockmatching motion estimation (BMME) is proposed in this paper. Simulation results demonstrate that the proposed DS algorithm greatly
Social Network Analysis for Routing in Disconnected Delaytolerant MANETs
, 2007
"... Message delivery in sparse Mobile Ad hoc Networks (MANETs) is difficult due to the fact that the network graph is rarely (if ever) connected. A key challenge is to find a route that can provide good delivery performance and low endtoend delay in a disconnected network graph where nodes may move fr ..."
Abstract

Cited by 276 (1 self)
 Add to MetaCart
where nodes are not required to exchange information about the entire network topology, but only locally available information is considered. Then SimBet Routing is proposed which exploits the exchange of preestimated ‘betweenness’ centrality metrics and locally determined social ‘similarity
Monetary Policy under Uncertainty
 IN MICROFOUNDED MACROECONOMETRIC MODELS,Â NBER MACROECONOMICS ANNUAL
, 2005
"... We use a microfounded macroeconometric modeling framework to investigate the design of monetary policy when the central bank faces uncertainty about the true structure of the economy. We apply Bayesian methods to estimate the parameters of the baseline specification using postwar U.S. data and then ..."
Abstract

Cited by 245 (14 self)
 Add to MetaCart
We use a microfounded macroeconometric modeling framework to investigate the design of monetary policy when the central bank faces uncertainty about the true structure of the economy. We apply Bayesian methods to estimate the parameters of the baseline specification using postwar U.S. data
Coil sensitivity encoding for fast MRI. In:
 Proceedings of the ISMRM 6th Annual Meeting,
, 1998
"... New theoretical and practical concepts are presented for considerably enhancing the performance of magnetic resonance imaging (MRI) by means of arrays of multiple receiver coils. Sensitivity encoding (SENSE) is based on the fact that receiver sensitivity generally has an encoding effect complementa ..."
Abstract

Cited by 193 (3 self)
 Add to MetaCart
coil array in brain imaging. With an array of five coils doubleoblique heart images were obtained in onethird of conventional scan time. Magn Reson Med 42:952962, 1999. 1999 WileyLiss, Inc. Key words: MRI; sensitivity encoding; SENSE; fast imaging; receiver coil array Among today's many medical
Extrapolation Methods for Accelerating PageRank Computations
 In Proceedings of the Twelfth International World Wide Web Conference
, 2003
"... We present a novel algorithm for the fast computation of PageRank, a hyperlinkbased estimate of the "importance" of Web pages. The original PageRank algorithm uses the Power Method to compute successive iterates that converge to the principal eigenvector of the Markov matrix representing ..."
Abstract

Cited by 167 (12 self)
 Add to MetaCart
We present a novel algorithm for the fast computation of PageRank, a hyperlinkbased estimate of the "importance" of Web pages. The original PageRank algorithm uses the Power Method to compute successive iterates that converge to the principal eigenvector of the Markov matrix representing
Fast random walk with restart and its applications
 In ICDM ’06: Proceedings of the 6th IEEE International Conference on Data Mining
, 2006
"... How closely related are two nodes in a graph? How to compute this score quickly, on huge, diskresident, real graphs? Random walk with restart (RWR) provides a good relevance score between two nodes in a weighted graph, and it has been successfully used in numerous settings, like automatic captionin ..."
Abstract

Cited by 179 (19 self)
 Add to MetaCart
captioning of images, generalizations to the “connection subgraphs”, personalized PageRank, and many more. However, the straightforward implementations of RWR do not scale for large graphs, requiring either quadratic space and cubic precomputation time, or slow response time on queries. We propose fast
Fast Approximation of Centrality
 Journal of Graph Algorithms and Applications
, 2001
"... Social studies researchers use graphs to model group activities in social networks. An important property in this context is the centrality of a vertex: the inverse of the average distance to each other vertex. We describe a randomized approximation algorithm for centrality in weighted graphs. For g ..."
Abstract

Cited by 55 (0 self)
 Add to MetaCart
. For graphs exhibiting the small world phenomenon, our method estimates the centrality of all vertices with high probability within a (1 + #) factor in nearlinear time. 1 Introduction In social network analysis, the vertices of a graph represent agents in a group and the edges represent relationships
Frequency estimation of internet packet streams with limited space
 IN PROCEEDINGS OF THE 10TH ANNUAL EUROPEAN SYMPOSIUM ON ALGORITHMS
, 2002
"... We consider a router on the Internet analyzing the statistical properties of a TCP/IP packet stream. A fundamental difficulty with measuring traffic behavior on the Internet is that there is simply too much data to be recorded for later analysis, on the order of gigabytes a second. As a result, net ..."
Abstract

Cited by 168 (1 self)
 Add to MetaCart
, network routers can collect only relatively few statistics about the data. The central problem addressed here is to use the limited memory of routers to determine essential features of the network traffic stream. A particularly difficult and representative subproblem is to determine the top k categories
Results 1  10
of
3,369