Sciweavers

4541 search results - page 452 / 909
» Cache-Oblivious Algorithms and Data Structures
Sort
View
SISAP
2009
IEEE
155views Data Mining» more  SISAP 2009»
15 years 11 months ago
Analyzing Metric Space Indexes: What For?
—It has been a long way since the beginnings of metric space searching, where people coming from algorithmics tried to apply their background to this new paradigm, obtaining vari...
Gonzalo Navarro
NIPS
2004
15 years 6 months ago
Efficient Kernel Discriminant Analysis via QR Decomposition
Linear Discriminant Analysis (LDA) is a well-known method for feature extraction and dimension reduction. It has been used widely in many applications such as face recognition. Re...
Tao Xiong, Jieping Ye, Qi Li, Ravi Janardan, Vladi...
161
Voted
SODA
2000
ACM
132views Algorithms» more  SODA 2000»
15 years 6 months ago
Expected-case complexity of approximate nearest neighbor searching
Most research in algorithms for geometric query problems has focused on their worstcase performance. However, when information on the query distribution is available, the alternat...
Sunil Arya, Ho-Yam Addy Fu
TSE
2010
136views more  TSE 2010»
15 years 3 months ago
A Theoretical and Empirical Study of Search-Based Testing: Local, Global, and Hybrid Search
Search based optimization techniques have been applied to structural software test data generation since 1992, with a recent upsurge in interest and activity within this area. How...
Mark Harman, Phil McMinn
154
Voted
KDD
2009
ACM
185views Data Mining» more  KDD 2009»
16 years 5 months ago
On compressing social networks
Motivated by structural properties of the Web graph that support efficient data structures for in memory adjacency queries, we study the extent to which a large network can be com...
Flavio Chierichetti, Ravi Kumar, Silvio Lattanzi, ...