2107 search results - page 258 / 422 » Computing Small Search Numbers in Linear Time |
RT
2000
Springer
14 years 24 days ago
2000
Springer
We present the concept of hierarchical instantiation for radiosity. This new method enables an efficient, yet accurate determination of the illumination in very large scenes, wher...
CIKM
2004
Springer
14 years 2 months ago
2004
Springer
Peer-to-peer Data Networks (PDNs) are large-scale, selforganizing, distributed query processing systems. Familiar examples of PDN are peer-to-peer file-sharing networks, which su...
AI
2010
Springer
13 years 9 months ago
2010
Springer
We consider soft constraint problems where some of the preferences may be unspecified. This models, for example, settings where agents are distributed and have privacy issues, or ...
SPAA
2004
ACM
14 years 2 months ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
IPPS
2009
IEEE
14 years 3 months ago
2009
IEEE
The increasing demand for computational cycles is being met by the use of multi-core processors. Having large number of cores per node necessitates multi-core aware designs to ext...