Sciweavers

23988 search results - page 4754 / 4798
» Social Network Computing
Sort
View
SIGMOD
2010
ACM
324views Database» more  SIGMOD 2010»
15 years 4 months ago
Similarity search and locality sensitive hashing using ternary content addressable memories
Similarity search methods are widely used as kernels in various data mining and machine learning applications including those in computational biology, web search/clustering. Near...
Rajendra Shinde, Ashish Goel, Pankaj Gupta, Debojy...
EUROCRYPT
2010
Springer
15 years 4 months ago
Adaptively Secure Broadcast
A broadcast protocol allows a sender to distribute a message through a point-to-point network to a set of parties, such that (i) all parties receive the same message, even if the s...
Martin Hirt, Vassilis Zikas
ICS
2010
Tsinghua U.
15 years 4 months ago
Large-scale FFT on GPU clusters
A GPU cluster is a cluster equipped with GPU devices. Excellent acceleration is achievable for computation-intensive tasks (e.g. matrix multiplication and LINPACK) and bandwidth-i...
Yifeng Chen, Xiang Cui, Hong Mei
PPPJ
2009
ACM
15 years 4 months ago
SlimVM: a small footprint Java virtual machine for connected embedded systems
The usage of cellular phones, PDAs, and other mobile devices has increased dramatically over the past ten years. Java is targeted to be one of the most popular execution environme...
Christoph Kerschbaumer, Gregor Wagner, Christian W...
CCO
2001
Springer
161views Combinatorics» more  CCO 2001»
15 years 4 months ago
Branch, Cut, and Price: Sequential and Parallel
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
Laszlo Ladányi, Ted K. Ralphs, Leslie E. Tr...
« Prev « First page 4754 / 4798 Last » Next »