290 search results - page 51 / 58 » Local Partitioning for Directed Graphs Using PageRank |
FSTTCS
2009
Springer
15 years 4 months ago
2009
Springer
The paper focuses on the structure of fundamental sequences of ordinals smaller than ε0. A first result is the construction of a monadic second-order formula identifying a given ...
NAACL
2003
14 years 11 months ago
2003
e by placing terms in an abstract ‘information space’ based on their occurrences in text corpora, and then allowing a user to visualize local regions of this information space....
WINE
2009
Springer
15 years 4 months ago
2009
Springer
We study the geometrical shape of the partitions of the input space created by the allocation rule of a truthful mechanism for multi-unit auctions with multidimensional types and ...
98
Voted
VISUALIZATION
2005
IEEE
15 years 3 months ago
2005
IEEE
The Multi Triangulation framework (MT) is a very general approach for managing adaptive resolution in triangle meshes. The key idea is arranging mesh fragments at different resolu...
84
Voted
IWMM
2009
Springer
15 years 4 months ago
2009
Springer
Tracing algorithms visit reachable nodes in a graph and are central to activities such as garbage collection, marshalling etc. Traditional sequential algorithms use a worklist, re...