1172 search results - page 33 / 235 » Path Algorithms on Regular Graphs |
99
Voted
STOC
2005
ACM
16 years 22 days ago
2005
ACM
Understanding the graph structure of the Internet is a crucial step for building accurate network models and designing efficient algorithms for Internet applications. Yet, obtaini...
97
Voted
ICHIT
2009
Springer
15 years 7 months ago
2009
Springer
Discovering the AS paths between two ASes are invaluable for a wide area of network research and application activities. The traditional techniques for path discovery require dire...
122
Voted
AAAI
2012
13 years 2 months ago
2012
Transfer learning proves to be effective for leveraging labeled data in the source domain to build an accurate classifier in the target domain. The basic assumption behind transf...
122
click to vote
ICALT
2006
IEEE
15 years 6 months ago
2006
IEEE
Generally speaking, in the e-learning systems, a course is modeled as a graph, where each node represents a knowledge node (KU) and two nodes are connected to form a semantic netw...
80
Voted
WEA
2009
Springer
15 years 7 months ago
2009
Springer
A dynamic shortest-path algorithm is called a batch algorithm if it is able to handle graph changes that consist of multiple edge updates at a time. In this paper we focus on fully...