7006 search results - page 610 / 1402 » Approximation Algorithms |
199
click to vote
SPAA
2004
ACM
16 years 20 days ago
2004
ACM
This paper considers the problem of packet-mode scheduling of input queuedswitches. Packets have variable lengths, and are divided into cells of unit length. Each packet arrives t...
182
click to vote
STOC
2005
ACM
16 years 7 months ago
2005
ACM
We show that every weighted connected graph G contains as a subgraph a spanning tree into which the edges of G can be embedded with average stretch O log2 n log log n . Moreover, w...
190
click to vote
KDD
2009
ACM
16 years 2 months ago
2009
ACM
In this paper we propose a utility model that accounts for both sales and branding advertisers. We first study the computational complexity of optimization problems related to bo...
171
click to vote
JCC
2002
15 years 7 months ago
2002
: A fast and general analytical approach was developed for the calculation of the approximate van der Waals and solvent-accessible surface areas. The method is based on three basic...
221
click to vote
ISVC
2009
Springer
15 years 11 months ago
2009
Springer
We present a new layered, hardware-accelerated splatting algorithm for volume rendering. Layered volume splatting features the speed benefits of fast axis-aligned pre-classified ...