Sciweavers

1578 search results - page 77 / 316
» Direct Routing: Algorithms and Complexity
Sort
View
GIS
2007
ACM
14 years 9 months ago
Evacuation route planning: scalable heuristics
Given a transportation network, a vulnerable population, and a set of destinations, evacuation route planning identifies routes to minimize the time to evacuate the vulnerable pop...
Sangho Kim, Betsy George, Shashi Shekhar
EUROCOLT
1995
Springer
14 years 9 days ago
The structure of intrinsic complexity of learning
Limiting identification of r.e. indexes for r.e. languages (from a presentation of elements of the language) and limiting identification of programs for computable functions (fr...
Sanjay Jain, Arun Sharma
ICALP
2007
Springer
14 years 2 months ago
Parameterized Approximability of the Disjoint Cycle Problem
Abstract. We give an fpt approximation algorithm for the directed vertex disjoint cycle problem. Given a directed graph G with n vertices and a positive integer k, the algorithm co...
Martin Grohe, Magdalena Grüber
CGF
2008
122views more  CGF 2008»
13 years 8 months ago
Accurate Shadows by Depth Complexity Sampling
The accurate generation of soft shadows is a particularly computationally intensive task. In order to reduce rendering time, most real-time and offline applications decorrelate th...
Vincent Forest, Loïc Barthe, Mathias Paulin
PKDD
2010
Springer
164views Data Mining» more  PKDD 2010»
13 years 6 months ago
Complexity Bounds for Batch Active Learning in Classification
Active learning [1] is a branch of Machine Learning in which the learning algorithm, instead of being directly provided with pairs of problem instances and their solutions (their l...
Philippe Rolet, Olivier Teytaud