Sciweavers

12194 search results - page 2141 / 2439
» Numberings Optimal for Learning
Sort
View
SODA
2004
ACM
128views Algorithms» more  SODA 2004»
15 years 8 months ago
Frugality in path auctions
We consider the problem of picking (buying) an inexpensive s-t path in a graph where edges are owned by independent (selfish) agents, and the cost of an edge is known to its owner...
Edith Elkind, Amit Sahai, Kenneth Steiglitz
VIIP
2001
15 years 8 months ago
Using Graphics Cards for Quantized FEM Computations
Graphics cards exercise increasingly more computing power and are highly optimized for high data transfer volumes. In contrast typical workstations perform badly when data exceeds...
Martin Rumpf, Robert Strzodka
177
Voted
STRINGOLOGY
2004
15 years 8 months ago
A Note on Bit-Parallel Alignment Computation
Abstract. The edit distance between strings A and B is defined as the minimum number of edit operations needed in converting A into B or vice versa. Typically the allowed edit oper...
Heikki Hyyrö
IM
2003
15 years 8 months ago
A Scalable and Efficient Inter-domain QoS Routing Architecture for Diffserv Networks
: With Bandwidth Broker (BB) support in each domain, Differentiated Services (Diffserv) is seen as a key technology for achieving QoS guarantees in a scalable, efficient, and deplo...
Haci A. Mantar, Junseok Hwang, Steve J. Chapin, Ib...
IMAGING
2003
15 years 8 months ago
A Multi-Ink Color-Separation Algorithm Maximizing Color Constancy
Current color-printing technologies may use three or more inks, e.g., CMY, CMYK, CMYKcm, CMYKGO, CMYKRGB. When the number of inks exceeds three, there is the usual color-managemen...
Yongda Chen, Roy S. Berns, Lawrence A. Taplin, Fra...
« Prev « First page 2141 / 2439 Last » Next »