893 search results - page 70 / 179 » Descent Theory for Schemes |
120
click to vote
STOC
2006
ACM
16 years 6 days ago
2006
ACM
Let > 0 be a constant. For any edge-weighted planar graph G and a subset S of nodes of G, there is a subgraph H of G of weight a constant times that of the minimum Steiner tree...
ICCAD
2006
IEEE
15 years 8 months ago
2006
IEEE
We present the first efficient approach to global routing that takes spacing-dependent costs into account and provably finds a near-optimum solution including these costs. We sh...
104
click to vote
SCALESPACE
2009
Springer
15 years 6 months ago
2009
Springer
We study the mathematical and numerical aspects of the estimation of the 3-D shape of a Lambertian scene seen under diffuse illumination. This problem is known as “shape from amb...
CDC
2008
IEEE
15 years 6 months ago
2008
IEEE
—A robust active queue management (AQM) scheme based on H-infinty theory is presented for the problem of congestion control in TCP communication networks. In TCP/IP networks, the...
GLOBECOM
2008
IEEE
15 years 6 months ago
2008
IEEE
—This paper proposes the so-called adaptive resource scheduling (ARS) schemes to cope with both uplink and downlink traffic transmissions in WiMAX, in order to fully utilize the ...