Sciweavers

1709 search results - page 128 / 342
» Comparing the Performance of Database Selection Algorithms
Sort
View
SIGMOD
2010
ACM
239views Database» more  SIGMOD 2010»
15 years 5 months ago
Call to order: a hierarchical browsing approach to eliciting users' preference
Computing preference queries has received a lot of attention in the database community. It is common that the user is unsure of his/her preference, so care must be taken to elicit...
Feng Zhao, Gautam Das, Kian-Lee Tan, Anthony K. H....
GLOBECOM
2007
IEEE
15 years 11 months ago
Beamforming with Limited Feedback in Amplify-and-Forward Cooperative Networks
— A relay selection approach has previously been shown to outperform repetition-based scheduling for both amplify-and-forward (AF) and decode-and-forward (DF) cooperative network...
Yi Zhao, Raviraj Adve, Teng Joon Lim
ICML
2003
IEEE
16 years 5 months ago
Stochastic Local Search in k-Term DNF Learning
A novel native stochastic local search algorithm for solving k-term DNF problems is presented. It is evaluated on hard k-term DNF problems that lie on the phase transition and com...
Stefan Kramer, Ulrich Rückert
SIGMOD
2007
ACM
145views Database» more  SIGMOD 2007»
16 years 5 months ago
Why off-the-shelf RDBMSs are better at XPath than you might expect
To compensate for the inherent impedance mismatch between the relational data model (tables of tuples) and XML (ordered, unranked trees), tree join algorithms have become the prev...
Torsten Grust, Jan Rittinger, Jens Teubner
AAAI
2006
15 years 6 months ago
A Direct Evolutionary Feature Extraction Algorithm for Classifying High Dimensional Data
Among various feature extraction algorithms, those based on genetic algorithms are promising owing to their potential parallelizability and possible applications in large scale an...
Qijun Zhao, David Zhang, Hongtao Lu