Sciweavers

37 search results - page 4 / 8
» Some Sieving Algorithms for Lattice Problems
Sort
View
IEEECIT
2005
IEEE
13 years 12 months ago
Management and Retrieval of Web Services Based on Formal Concept Analysis
After introducing some basic concepts of Web services and the definition of their relationships, we formally define the problem of managing and retrieving of Web services. This pa...
Dunlu Peng, Sheng Huang, Xiaoling Wang, Aoying Zho...
TWC
2008
158views more  TWC 2008»
13 years 6 months ago
Solving Box-Constrained Integer Least Squares Problems
A box-constrained integer least squares problem (BILS) arises from several wireless communications applications. Solving a BILS problem usually has two stages: reduction (or prepro...
Xiao-Wen Chang, Qing Han
DBWORKSHOPS
1992
13 years 7 months ago
An Incremental Concept Formation Approach for Learning from Databases
Godin, R. and R. Missaoui, An incremental concept formation approach for learning from databases, Theoretical Computer Science 133 (1994) 3533385. This paper describes a concept f...
Rokia Missaoui, Robert Godin
JC
2008
128views more  JC 2008»
13 years 6 months ago
Lattice rule algorithms for multivariate approximation in the average case setting
We study multivariate approximation for continuous functions in the average case setting. The space of d variate continuous functions is equipped with the zero mean Gaussian measu...
Frances Y. Kuo, Ian H. Sloan, Henryk Wozniakowski
CSC
2006
13 years 7 months ago
Developing Efficient Option Pricing Algorithms by Combinatorial Techniques
How to price options efficiently and accurately is an important research problem. Options can be priced by the lattice model. Although the pricing results converge to the theoreti...
Tian-Shyr Dai, Yuh-Dauh Lyuu, Li-min Liu