Sciweavers

2125 search results - page 131 / 425
» On Graph Complexity
Sort
View
JALC
2002
97views more  JALC 2002»
14 years 9 months ago
Semiring Frameworks and Algorithms for Shortest-Distance Problems
We define general algebraic frameworks for shortest-distance problems based on the structure of semirings. We give a generic algorithm for finding single-source shortest distances...
Mehryar Mohri
CIKM
2009
Springer
15 years 4 months ago
iPoG: fast interactive proximity querying on graphs
Given an author-conference graph, how do we answer proximity queries (e.g., what are the most related conferences for John Smith?); how can we tailor the search result if the user...
Hanghang Tong, Huiming Qu, Hani Jamjoom, Christos ...
ICML
2005
IEEE
15 years 10 months ago
Learning from labeled and unlabeled data on a directed graph
We propose a general framework for learning from labeled and unlabeled data on a directed graph in which the structure of the graph including the directionality of the edges is co...
Bernhard Schölkopf, Dengyong Zhou, Jiayuan Hu...
PC
2000
93views Management» more  PC 2000»
14 years 9 months ago
Scheduling outtrees of height one in the LogP model
The LogP model is a model of parallel computation that characterises a parallel computer system by four parameters: the latency L, the overhead o, the gap g and the number of proc...
Jacques Verriet
IJCNN
2007
IEEE
15 years 4 months ago
3D-SE Viewer: A Text Mining Tool based on Bipartite Graph Visualization
—A new interactive visualization tool is proposed for textual data mining based on bipartite graph visualization. Applications to three text datasets are presented to show the ca...
Shiro Usui, Antoine Naud, Naonori Ueda, Tatsuki Ta...