Sciweavers

10901 search results - page 2081 / 2181
» Approximations in Distributed Optimization
Sort
View
124
Voted
PPOPP
1997
ACM
15 years 7 months ago
LoPC: Modeling Contention in Parallel Algorithms
Parallel algorithm designers need computational models that take first order system costs into account, but are also simple enough to use in practice. This paper introduces the L...
Matthew Frank, Anant Agarwal, Mary K. Vernon
131
Voted
SIGMOD
1997
ACM
127views Database» more  SIGMOD 1997»
15 years 7 months ago
Fast Parallel Similarity Search in Multimedia Databases
Most similarity search techniques map the data objects into some high-dimensional feature space. The similarity search then corresponds to a nearest-neighbor search in the feature...
Stefan Berchtold, Christian Böhm, Bernhard Br...
EUROPAR
1997
Springer
15 years 7 months ago
Modulo Scheduling with Cache Reuse Information
Instruction scheduling in general, and software pipelining in particular face the di cult task of scheduling operations in the presence of uncertain latencies. The largest contrib...
Chen Ding, Steve Carr, Philip H. Sweany
186
Voted
SPAA
1993
ACM
15 years 7 months ago
Asymptotically Tight Bounds for Performing BMMC Permutations on Parallel Disk Systems
d Abstract) Thomas H. Cormen Leonard F. Wisniewski Department of Mathematics and Computer Science Dartmouth College We give asymptotically equal lower and upper bounds for the num...
Thomas H. Cormen, Leonard F. Wisniewski
122
Voted
ACMICEC
2007
ACM
148views ECommerce» more  ACMICEC 2007»
15 years 7 months ago
Pricing digital content with DRM mechanism
The Internet and file sharing technology (such as P2P network) significantly alleviate the content distribution cost. However, better digital content distribution also means that ...
Yung-Ming Li, Chia-Hao Lin
« Prev « First page 2081 / 2181 Last » Next »