336 search results - page 35 / 68 » Approximating Transitivity in Directed Networks |
CGF
2008
13 years 11 months ago
2008
We present a new, real-time method for rendering soft shadows from large light sources or lighting environments on dynamic height fields. The method first computes a horizon map f...
PPSN
2000
Springer
14 years 2 months ago
2000
Springer
Abstract. We explore a new general-purpose heuristic for nding highquality solutions to hard optimization problems. The method, called extremal optimization, is inspired by self-or...
ICDCN
2009
Springer
14 years 3 months ago
2009
Springer
Wireless sensor networks with multiple users collecting data directly from the sensors have many potential applications. An important problem is to allocate for each user a query r...
DISOPT
2008
13 years 11 months ago
2008
We define the k-path tree matroid, and use it to solve network design problems in which the required connectivity is arbitrary for a given pair of nodes, and 1 for the other pairs...
ICASSP
2011
IEEE
13 years 2 months ago
2011
IEEE
Predicting accurately the spatiotemporal evolution of a diffusive environmental hazard is of paramount importance for its effective containment. We approximate the front line of a...