Sciweavers

2294 search results - page 268 / 459
» From Path Graphs to Directed Path Graphs
Sort
View
CORR
2011
Springer
147views Education» more  CORR 2011»
14 years 10 months ago
Human-Assisted Graph Search: It's Okay to Ask Questions
We consider the problem of human-assisted graph search: given a directed acyclic graph with some (unknown) target node(s), we consider the problem of finding the target node(s) b...
Aditya G. Parameswaran, Anish Das Sarma, Hector Ga...
WIOPT
2005
IEEE
15 years 9 months ago
A New Relaying Scheme for Cheap Wireless Relay Nodes
Wireless networks consist of senders, receivers, and intermediate nodes that collaborating (more or less) to establish the communication paths. Most of the researches in the domai...
Ramin Khalili, Kavé Salamatian
123
Voted
IPPS
2007
IEEE
15 years 9 months ago
A Multi-Level Parallel Implementation of a Program for Finding Frequent Patterns in a Large Sparse Graph
Graphs capture the essential elements of many problems broadly defined as searching or categorizing. With the rapid increase of data volumes from sensors, many application discipl...
Steve Reinhardt, George Karypis
WEBI
2005
Springer
15 years 8 months ago
WICER: A Weighted Inter-Cluster Edge Ranking for Clustered Graphs
Several algorithms based on link analysis have been developed to measure the importance of nodes on a graph such as pages on the World Wide Web. PageRank and HITS are the most pop...
Divya Padmanabhan, Prasanna Kumar Desikan, Jaideep...
COMPGEOM
2003
ACM
15 years 8 months ago
Planar minimally rigid graphs and pseudo-triangulations
Pointed pseudo-triangulations are planar minimally rigid graphs embedded in the plane with pointed vertices (adjacent to an angle larger than π). In this paper we prove that the ...
Ruth Haas, David Orden, Günter Rote, Francisc...