Sciweavers

413 search results - page 26 / 83
» Lattice Boltzmann Method
Sort
View
PAKDD
2000
ACM
128views Data Mining» more  PAKDD 2000»
14 years 1 days ago
Efficient Detection of Local Interactions in the Cascade Model
Detection of interactions among data items constitutes an essential part of knowledge discovery. The cascade model is a rule induction methodology using levelwise expansion of a la...
Takashi Okada
TCOM
2010
112views more  TCOM 2010»
13 years 6 months ago
On further reduction of complexity in tree pruning based sphere search
Abstract—In this letter, we propose an extension of the probabilistic tree pruning sphere decoding (PTP-SD) algorithm that provides further improvement of the computational compl...
Byonghyo Shim, Insung Kang
CLA
2004
13 years 10 months ago
Concept Lattice Generation by Singular Value Decomposition
Abstract. Latent semantic indexing (LSI) is an application of numerical method called singular value decomposition (SVD), which discovers latent semantic in documents by creating c...
Petr Gajdos, Pavel Moravec, Václav Sn&aacut...
WSC
1998
13 years 9 months ago
Efficiency Improvement by Lattice Rules for Pricing Asian Options
This paper compares Monte Carlo methods, lattice rules, and other low-discrepancy point sets on the problem of evaluating asian options. The combination of these methods with vari...
Christiane Lemieux, Pierre L'Ecuyer
SODA
2007
ACM
76views Algorithms» more  SODA 2007»
13 years 10 months ago
An unbiased pointing operator for unlabeled structures, with applications to counting and sampling
We introduce a general method to count and randomly sample unlabeled combinatorial structures. The approach is based on pointing unlabeled structures in an “unbiased” way, i.e...
Manuel Bodirsky, Éric Fusy, Mihyun Kang, St...