330 search results - page 54 / 66 » Random Indexing Revisited |
SIGGRAPH
2010
ACM
15 years 4 months ago
2010
ACM
In this paper, we introduce a compact random-access vector representation for solid textures made of intermixed regions with relatively smooth internal color variations. It is fea...
141
Voted
DAWAK
2000
Springer
15 years 4 months ago
2000
Springer
Abstract. Feature Extraction, also known as Multidimensional Scaling, is a basic primitive associated with indexing, clustering, nearest neighbor searching and visualization. We co...
CISSE
2007
Springer
15 years 4 months 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...
95
Voted
CIKM
2009
Springer
15 years 4 months 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...
109
click to vote
DEXAW
2005
IEEE
15 years 2 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...