Sciweavers

1568 search results - page 223 / 314
» The problem of examination questions in algorithmics
Sort
View
SODA
2012
ACM
208views Algorithms» more  SODA 2012»
13 years 6 months ago
Partial match queries in random quadtrees
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the traditional model where the...
Nicolas Broutin, Ralph Neininger, Henning Sulzbach
WWW
2004
ACM
16 years 5 months ago
Shilling recommender systems for fun and profit
Recommender systems have emerged in the past several years as an effective way to help people cope with the problem of information overload. One application in which they have bec...
Shyong K. Lam, John Riedl
SC
2000
ACM
15 years 8 months ago
Performance of Hybrid Message-Passing and Shared-Memory Parallelism for Discrete Element Modeling
The current trend in HPC hardware is towards clusters of shared-memory (SMP) compute nodes. For applications developers the major question is how best to program these SMP cluster...
D. S. Henty
STOC
1996
ACM
185views Algorithms» more  STOC 1996»
15 years 8 months ago
Adaptively Secure Multi-Party Computation
A fundamental problem in designing secure multi-party protocols is how to deal with adaptive adversaries i.e., adversaries that may choose the corrupted parties during the course ...
Ran Canetti, Uriel Feige, Oded Goldreich, Moni Nao...
BMCBI
2005
122views more  BMCBI 2005»
15 years 4 months ago
FACT - a framework for the functional interpretation of high-throughput experiments
Background: Interpreting the results of high-throughput experiments, such as those obtained from DNA-microarrays, is an often time-consuming task due to the high number of data-po...
Felix Kokocinski, Nicolas Delhomme, Gunnar Wrobel,...