103 search results - page 18 / 21 » Computing approximate shortest paths on convex polytopes |
ATMOS
2010
13 years 5 months ago
2010
The track allocation problem, also known as train routing problem or train timetabling problem, is to find a conflict-free set of train routes of maximum value in a railway netw...
BMCBI
2008
13 years 6 months ago
2008
Background: Cellular metabolism is one of the most investigated system of biological interactions. While the topological nature of individual reactions and pathways in the network...
ICDE
2009
IEEE
14 years 8 months ago
2009
IEEE
The popularity of location-based services and the need to do real-time processing on them has led to an interest in performing queries on transportation networks, such as finding s...
ICCV
2007
IEEE
14 years 8 months ago
2007
IEEE
We present the first method to compute depth cues from images taken solely under uncalibrated near point lighting. A stationary scene is illuminated by a point source that is move...
SIGECOM
2010
ACM
13 years 11 months ago
2010
ACM
It is widely believed that computing payments needed to induce truthful bidding is somehow harder than simply computing the allocation. We show that the opposite is true for singl...