Sciweavers

371 search results - page 27 / 75
» FPGAs: a new point in the database design space
Sort
View
JCP
2007
118views more  JCP 2007»
14 years 9 months ago
Dynamic Nonuniform Data Approximation in Databases with Haar Wavelet
Abstract— Data synopsis is a lossy compressed representation of data stored into databases that helps the query optimizer to speed up the query process, e.g. time to retrieve the...
Su Chen, Antonio Nucci
DASFAA
2010
IEEE
139views Database» more  DASFAA 2010»
15 years 4 months ago
Highly Scalable Multiprocessing Algorithms for Preference-Based Database Retrieval
Abstract. Until recently algorithms continuously gained free performance improvements due to ever increasing processor speeds. Unfortunately, this development has reached its limit...
Joachim Selke, Christoph Lofi, Wolf-Tilo Balke
SSDBM
2010
IEEE
127views Database» more  SSDBM 2010»
15 years 2 months ago
Optimizing All-Nearest-Neighbor Queries with Trigonometric Pruning
Many applications require to determine the k-nearest neighbors for multiple query points simultaneously. This task is known as all-(k)-nearest-neighbor (AkNN) query. In this paper,...
Tobias Emrich, Franz Graf, Hans-Peter Kriegel, Mat...
ISCI
2007
141views more  ISCI 2007»
14 years 9 months ago
A performance comparison of distance-based query algorithms using R-trees in spatial databases
Efficient processing of distance-based queries (DBQs) is of great importance in spatial databases due to the wide area of applications that may address such queries. The most repr...
Antonio Corral, Jesús Manuel Almendros-Jim&...
MCS
2002
Springer
14 years 9 months ago
A Discussion on the Classifier Projection Space for Classifier Combining
In classifier combining, one tries to fuse the information that is given by a set of base classifiers. In such a process, one of the difficulties is how to deal with the variabilit...
Elzbieta Pekalska, Robert P. W. Duin, Marina Skuri...