Sciweavers

317 search results - page 27 / 64
» Computing and Updating the Process Number in Trees
Sort
View
SSDBM
2011
IEEE
239views Database» more  SSDBM 2011»
14 years 5 months ago
Recipes for Baking Black Forest Databases - Building and Querying Black Hole Merger Trees from Cosmological Simulations
Large-scale N-body simulations play an important role in advancing our understanding of the formation and evolution of large structures in the universe. These computations require ...
Julio López, Colin Degraf, Tiziana DiMatteo...
DAWAK
2004
Springer
15 years 6 months ago
A Tree Partitioning Method for Memory Management in Association Rule Mining
All methods of association rule mining require the frequent sets of items, that occur together sufficiently often to be the basis of potentially interesting rules, to be first com...
Shakil Ahmed, Frans Coenen, Paul H. Leng
COMGEO
2000
ACM
15 years 1 months ago
Fast and accurate collision detection for haptic interaction using a three degree-of-freedom force-feedback device
We present a fast and accurate collision detection algorithm for haptic interaction with polygonal models. Given a model, we pre-compute a hybrid hierarchical representation, cons...
Arthur D. Gregory, Ming C. Lin, Stefan Gottschalk,...
ECAI
2006
Springer
15 years 5 months ago
Least Squares SVM for Least Squares TD Learning
Abstract. We formulate the problem of least squares temporal difference learning (LSTD) in the framework of least squares SVM (LS-SVM). To cope with the large amount (and possible ...
Tobias Jung, Daniel Polani
DKE
2007
153views more  DKE 2007»
15 years 1 months ago
Adaptive similarity search in streaming time series with sliding windows
The challenge in a database of evolving time series is to provide efficient algorithms and access methods for query processing, taking into consideration the fact that the databas...
Maria Kontaki, Apostolos N. Papadopoulos, Yannis M...