290 search results - page 27 / 58 » Local Partitioning for Directed Graphs Using PageRank |
128
click to vote
AGTIVE
2003
Springer
15 years 7 months ago
2003
Springer
Many polygon mesh algorithms operate in a local manner, yet are formally specified using global indexing schemes. This obscures the essence of these algorithms and makes their spe...
130
click to vote
NAR
2006
15 years 2 months ago
2006
Multiple sequence alignment programs are an invaluable tool in computational biology. A-Bruijn Alignment (ABA) is a method for multiple sequence alignment that represents an align...
119
click to vote
ECCV
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. Markov and Conditional random fields (CRFs) used in computer vision typically model only local interactions between variables, as this is computationally tractable. In t...
124
click to vote
ICML
2009
IEEE
16 years 3 months ago
2009
IEEE
The problem of choosing fast implementations for a class of recursive algorithms such as the fast Fourier transforms can be formulated as an optimization problem over the language...
130
click to vote
SIROCCO
2008
15 years 3 months ago
2008
The augmented graph model, as introduced by Kleinberg (STOC 2000), is an appealing model for analyzing navigability in social networks. Informally, this model is defined by a pair...