Sciweavers

4908 search results - page 309 / 982
» On the Complexity of Optimal K-Anonymity
Sort
View
CLUSTER
2006
IEEE
15 years 6 months ago
Optimizing MPI collective communication by orthogonal structures
Many parallel applications from scientific computing use MPI collective communication operations to collect or distribute data. Since the execution times of these communication op...
Matthias Kühnemann, Thomas Rauber, Gudula R&u...
IVS
2007
110views more  IVS 2007»
15 years 6 months ago
An automated approach for the optimization of pixel-based visualizations
During the last two decades, a wide variety of advanced methods for the visual exploration of large data sets have been proposed. For most of these techniques user interaction has...
Jörn Schneidewind, Mike Sips, Daniel A. Keim
BMCBI
2002
108views more  BMCBI 2002»
15 years 6 months ago
A memory-efficient dynamic programming algorithm for optimal alignment of a sequence to an RNA secondary structure
Background: Covariance models (CMs) are probabilistic models of RNA secondary structure, analogous to profile hidden Markov models of linear sequence. The dynamic programming algo...
Sean R. Eddy
CN
2002
82views more  CN 2002»
15 years 6 months ago
Optimal allocation of electronic content
Abstract-The delivery of large files to single users, such as application programs for some versions of the envisioned network computer, or movies, is expected by many to be one of...
Israel Cidon, Shay Kutten, Ran Soffer
KDD
2010
ACM
272views Data Mining» more  KDD 2010»
15 years 5 months ago
Scalable similarity search with optimized kernel hashing
Scalable similarity search is the core of many large scale learning or data mining applications. Recently, many research results demonstrate that one promising approach is creatin...
Junfeng He, Wei Liu, Shih-Fu Chang