Sciweavers

84 search results - page 8 / 17
» A Benchmark for Online Index Selection
Sort
View
ICDE
2012
IEEE
240views Database» more  ICDE 2012»
11 years 10 months ago
Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
Miao Qiao, Hong Cheng, Lijun Chang, Jeffrey Xu Yu
IJCNN
2006
IEEE
14 years 1 months ago
Dynamic Hyperparameter Scaling Method for LVQ Algorithms
— We propose a new annealing method for the hyperparameters of several recent Learning Vector Quantization algorithms. We first analyze the relationship between values assigned ...
Sambu Seo, Klaus Obermayer
ICAPR
2005
Springer
14 years 29 days ago
3D Model Retrieval Based on Adaptive Views Clustering
In this paper, we propose a method for 3D model indexing based on 2D views, named AVC (Adaptive Views Clustering). The goal of this method is to provide an optimal selection of 2D ...
Tarik Filali Ansary, Mohamed Daoudi, Jean-Philippe...
SIGMOD
2010
ACM
208views Database» more  SIGMOD 2010»
13 years 5 months ago
An automated, yet interactive and portable DB designer
Tuning tools attempt to configure a database to achieve optimal performance for a given workload. Selecting an optimal set of physical structures is computationally hard since it ...
Ioannis Alagiannis, Debabrata Dash, Karl Schnaitte...
WWW
2007
ACM
14 years 8 months ago
Multi-factor clustering for a marketplace search interface
Search engines provide a small window to the vast repository of data they index and against which they search. They try their best to return the documents that are of relevance to...
Neel Sundaresan, Kavita Ganesan, Roopnath Grandhi