221 search results - page 35 / 45 » Random Indexing K-tree |
CISSE
2007
Springer
14 years 10 days ago
2007
Springer
Abstract- This paper explores valuing long-term equity forwardcontracts or futures where both the underlying volatility and the interest rates are modeled as stochastic random vari...
CIKM
2009
Springer
14 years 10 days ago
2009
Springer
A suffix tree is a fundamental data structure for string searching algorithms. Unfortunately, when it comes to the use of suffix trees in real-life applications, the current metho...
DEXAW
2005
IEEE
13 years 10 months ago
2005
IEEE
Routing in unstructured peer-to-peer systems relies either on broadcasting (also called flooding) or on routing indices. An approach using routing indices is only scalable if the...
CIDR
2007
13 years 10 months ago
2007
Database indices provide a non-discriminative navigational infrastructure to localize tuples of interest. Their maintenance cost is taken during database updates. In this paper, w...
COMAD
2008
13 years 10 months ago
2008
Asynchronous IO (AIO) allows a process to continue to do other work while an IO operation initiated earlier completes. AIO allows a large number of random IO operations to be issu...