Sciweavers

127 search results - page 1 / 26
» Mode Directed Path Finding
Sort
View
ECML
2005
Springer
13 years 10 months ago
Mode Directed Path Finding
Abstract. Learning from multi-relational domains has gained increasing attention over the past few years. Inductive logic programming (ILP) systems, which often rely on hill-climbi...
Irene M. Ong, Inês de Castro Dutra, David Pa...
WG
2010
Springer
13 years 3 months ago
From Path Graphs to Directed Path Graphs
We present a linear time algorithm to greedily orient the edges of a path graph model to obtain a directed path graph model (when possible). Moreover we extend this algorithm to fi...
Steven Chaplick, Marisa Gutierrez, Benjamin L&eacu...
ICDE
2009
IEEE
149views Database» more  ICDE 2009»
14 years 7 months ago
OPAQUE: Protecting Path Privacy in Directions Search
Directions search returns the shortest path from a source to a destination on a road network. However, the search interests of users may be exposed to the service providers, thus r...
Ken C. K. Lee, Wang-Chien Lee, Hong Va Leong, Baih...
PRESENCE
1998
101views more  PRESENCE 1998»
13 years 4 months ago
Locomotion Mode Affects the Updating of Objects Encountered During Travel: The Contribution of Vestibular and Proprioceptive Inp
In two experiments, subjects traveled through virtual mazes, encountering target objects along the way. Their task was to indicate the direction to these target objects from a ter...
Sarah S. Chance, Florence Gaunet, Andrew C. Beall,...
FSTTCS
2010
Springer
13 years 2 months ago
Finding Sparser Directed Spanners
A spanner of a graph is a sparse subgraph that approximately preserves distances in the original graph. More precisely, a subgraph H = (V, EH ) is a k-spanner of a graph G = (V, E...
Piotr Berman, Sofya Raskhodnikova, Ge Ruan