Sciweavers

3780 search results - page 745 / 756
» Algorithms for Game Metrics
Sort
View
KDD
2000
ACM
149views Data Mining» more  KDD 2000»
13 years 11 months ago
Efficient clustering of high-dimensional data sets with application to reference matching
Many important problems involve clustering large datasets. Although naive implementations of clustering are computationally expensive, there are established efficient techniques f...
Andrew McCallum, Kamal Nigam, Lyle H. Ungar
VVS
1995
IEEE
132views Visualization» more  VVS 1995»
13 years 11 months ago
Multi-Dimensional Trees for Controlled Volume Rendering and Compression
This paper explores the use of multi-dimensional trees to provide spatial and temporal e ciencies in imaging large data sets. Each node of the tree contains a model of the data in...
Jane Wilhelms, Allen Van Gelder
CIKM
2008
Springer
13 years 9 months ago
Multi-aspect expertise matching for review assignment
Review assignment is a common task that many people such as conference organizers, journal editors, and grant administrators would have to do routinely. As a computational problem...
Maryam Karimzadehgan, ChengXiang Zhai, Geneva G. B...
CIKM
2008
Springer
13 years 9 months ago
Using English information in non-English web search
The leading web search engines have spent a decade building highly specialized ranking functions for English web pages. One of the reasons these ranking functions are effective is...
Wei Gao, John Blitzer, Ming Zhou
CASES
2005
ACM
13 years 9 months ago
A post-compilation register reassignment technique for improving hamming distance code compression
Code compression is a field where compression ratios between compiler-generated code and subsequent compressed code are highly dependent on decisions made at compile time. Most op...
Montserrat Ros, Peter Sutton