Sciweavers

943 search results - page 43 / 189
» How should data structures and algorithms be taught
Sort
View
SIAMSC
2011
85views more  SIAMSC 2011»
14 years 15 days ago
Refinement and Connectivity Algorithms for Adaptive Discontinuous Galerkin Methods
Abstract. Adaptive multiscale methods are among the many effective techniques for the numerical solution of partial differential equations. Efficient grid management is an import...
Kolja Brix, Ralf Massjung, Alexander Voss
SIGIR
2005
ACM
15 years 3 months ago
Publish/subscribe functionality in IR environments using structured overlay networks
We study the problem of offering publish/subscribe functionality on top of structured overlay networks using data models and languages from IR. We show how to achieve this by ext...
Christos Tryfonopoulos, Stratos Idreos, Manolis Ko...
ASWC
2009
Springer
15 years 4 months ago
Supporting the Development of Data Wrapping Ontologies
Abstract. We consider the problem of designing data wrapping ontologies whose purpose is to describe relational data sources and to provide a semantically enriched access to the un...
Lina Lubyte, Sergio Tessaris
SDM
2008
SIAM
135views Data Mining» more  SDM 2008»
14 years 11 months ago
Preemptive Measures against Malicious Party in Privacy-Preserving Data Mining
Currently, many privacy-preserving data mining (PPDM) algorithms assume the semi-honest model and/or malicious model of multi-party interaction. However, both models are far from ...
Shuguo Han, Wee Keong Ng
BMCBI
2006
169views more  BMCBI 2006»
14 years 9 months ago
Comparative analysis of haplotype association mapping algorithms
Background: Finding the genetic causes of quantitative traits is a complex and difficult task. Classical methods for mapping quantitative trail loci (QTL) in miceuse an F2 cross b...
Phillip McClurg, Mathew T. Pletcher, Tim Wiltshire...