Sciweavers

107 search results - page 12 / 22
» On derivations of lattices
Sort
View
CSC
2006
14 years 8 days 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
LREC
2008
90views Education» more  LREC 2008»
14 years 9 days ago
Navigating through Dense Annotation Spaces
Pattern matching, or querying, over annotations is a general purpose paradigm for inspecting, navigating, mining, and transforming annotation repositories--the common representati...
Branimir Boguraev, Mary S. Neff
JCT
2007
110views more  JCT 2007»
13 years 10 months ago
Bijective counting of Kreweras walks and loopless triangulations
Abstract. We consider lattice walks in the plane starting at the origin, remaining in the first quadrant i, j ≥ 0 and made of West, South and North-East steps. In 1965, Germain ...
Olivier Bernardi
ICC
2008
IEEE
115views Communications» more  ICC 2008»
14 years 5 months ago
Connectivity Model for Wireless Mesh Networks
—This paper presents a novel methodology for finding the network connectivity in wireless mesh networks while taking into account dependencies existing between links of geometri...
Mohamed Abou El Saoud, Hussein Al-Zubaidy, Samy Ma...
ACISP
2010
Springer
14 years 13 days ago
Solving Generalized Small Inverse Problems
We introduce a "generalized small inverse problem (GSIP)" and present an algorithm for solving this problem. GSIP is formulated as finding small solutions of f(x0, x1, . ...
Noboru Kunihiro