Sciweavers

1051 search results - page 208 / 211
» On the Correspondence between Approximations and Similarity
Sort
View
123
Voted
SIGIR
1992
ACM
15 years 1 months ago
Bead: Explorations in Information Visualization
ct We describe work on the visualization of bibliographic data and, to aid in this task, the application of numerical techniques for multidimensional scaling. Many areas of scienti...
Matthew Chalmers, Paul Chitson
KDD
2010
ACM
252views Data Mining» more  KDD 2010»
15 years 1 months ago
Fast query execution for retrieval models based on path-constrained random walks
Many recommendation and retrieval tasks can be represented as proximity queries on a labeled directed graph, with typed nodes representing documents, terms, and metadata, and labe...
Ni Lao, William W. Cohen
130
Voted
SBBD
2008
256views Database» more  SBBD 2008»
14 years 11 months ago
Indexing Internal Memory with Minimal Perfect Hash Functions
A perfect hash function (PHF) is an injective function that maps keys from a set S to unique values, which are in turn used to index a hash table. Since no collisions occur, each k...
Fabiano C. Botelho, Hendrickson R. Langbehn, Guilh...
104
Voted
PDCN
2004
14 years 11 months ago
Speculative prefetching of optional locks in distributed systems
We present a family of methods for speeding up distributed locks by exploiting the uneven distribution of both temporal and spatial locality of access behaviour of many applicatio...
Thomas Schöbel-Theuer
WSC
1997
14 years 11 months ago
Covalidation of Dissimilarly Structured Models
A methodology is presented which allows comparison between models under different modeling paradigms. Consider the following situation: Two models have been constructed to study d...
Samuel A. Wright, Kenneth W. Bauer Jr.