Sciweavers

627 search results - page 13 / 126
» Privacy-Preserving k-NN for Small and Large Data Sets
Sort
View
90
Voted
ALENEX
2003
144views Algorithms» more  ALENEX 2003»
15 years 16 days ago
Cache-Conscious Sorting of Large Sets of Strings with Dynamic Tries
Ongoing changes in computer performance are affecting the efficiency of string sorting algorithms. The size of main memory in typical computers continues to grow, but memory acce...
Ranjan Sinha, Justin Zobel
CLEF
2008
Springer
15 years 29 days ago
Overview of VideoCLEF 2008: Automatic Generation of Topic-Based Feeds for Dual Language Audio-Visual Content
The VideoCLEF track, introduced in 2008, aims to develop and evaluate tasks related to analysis of and access to multilingual multimedia content. In its first year, VideoCLEF pilo...
Martha Larson, Eamonn Newman, Gareth J. F. Jones
DRR
2010
15 years 1 months ago
Time and space optimization of document content classifiers
Scaling up document-image classifiers to handle an unlimited variety of document and image types poses serious challenges to conventional trainable classifier technologies. Highly...
Dawei Yin, Henry S. Baird, Chang An
IJCNN
2000
IEEE
15 years 3 months ago
The Inefficiency of Batch Training for Large Training Sets
Multilayer perceptrons are often trained using error backpropagation (BP). BP training can be done in either a batch or continuous manner. Claims have frequently been made that bat...
D. Randall Wilson, Tony R. Martinez
APVIS
2007
15 years 18 days ago
Interpreting large visual similarity matrices
Visual similarity matrices (VSMs) are a common technique for visualizing graphs and other types of relational data. While traditionally used for small data sets or well-ordered la...
Christopher Mueller, Benjamin Martin, Andrew Lumsd...