336 search results - page 35 / 68 » Approximating Transitivity in Directed Networks |
182
click to vote
CGF
2008
15 years 6 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...
200
click to vote
PPSN
2000
Springer
15 years 10 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...
173
click to vote
ICDCN
2009
Springer
15 years 11 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...
170
click to vote
DISOPT
2008
15 years 6 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...
159
click to vote
ICASSP
2011
IEEE
14 years 10 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...