Sciweavers

2796 search results - page 161 / 560
» The coolest path problem
Sort
View
IPL
2010
115views more  IPL 2010»
15 years 4 months ago
Hardness and approximation of minimum distortion embeddings
We show that the problem of computing a minimum distortion embedding of a given graph into a path remains NP-hard when the input graph is restricted to a bipartite, cobipartite, o...
Pinar Heggernes, Daniel Meister
SODA
2008
ACM
127views Algorithms» more  SODA 2008»
15 years 7 months ago
Nondecreasing paths in a weighted graph or: how to optimally read a train schedule
A travel booking office has timetables giving arrival and departure times for all scheduled trains, including their origins and destinations. A customer presents a starting city a...
Virginia Vassilevska
ALGORITHMICA
2010
131views more  ALGORITHMICA 2010»
15 years 6 months ago
A Preemptive Algorithm for Maximizing Disjoint Paths on Trees
We consider the online version of the maximum vertex disjoint path problem when the underlying network is a tree. In this problem, a sequence of requests arrives in an online fash...
Yossi Azar, Uriel Feige, Daniel Glasner
TROB
2010
103views more  TROB 2010»
15 years 28 days ago
Time Parameterization of Humanoid-Robot Paths
Abstract--This paper proposes a unified optimization framework to solve the time parameterization problem of humanoid robot paths. Even though the time parameterization problem is ...
Wael Suleiman, Fumio Kanehiro, Eiichi Yoshida, Jea...
DBSEC
2007
112views Database» more  DBSEC 2007»
15 years 7 months ago
Reliable Delivery of Event Data from Sensors to Actuators in Pervasive Computing Environments
Abstract. The event-condition-action (ECA) paradigm holds enormous potential in pervasive computing environments. However, the problem of reliable delivery of event data, generated...
Sudip Chakraborty, Nayot Poolsappasit, Indrajit Ra...