1709 search results - page 143 / 342 » Comparing the Performance of Database Selection Algorithms |
165
click to vote
DASFAA
2004
IEEE
15 years 10 months ago
2004
IEEE
Abstract. Data declustering speeds up large data set retrieval by partitioning the data across multiple disks or sites and performing retrievals in parallel. Performance is determi...
157
click to vote
AIA
2006
15 years 7 months ago
2006
Time series data is usually stored and processed in the form of discrete trajectories of multidimensional measurement points. In order to compare the measurements of a query traje...
164
click to vote
ICASSP
2010
IEEE
15 years 6 months ago
2010
IEEE
Before the advent of Hidden Markov Models(HMM)-based speech recognition, many speech applications were built using pattern matching algorithms like the Dynamic Time Warping (DTW) ...
182
click to vote
CIKM
2009
Springer
16 years 25 days ago
2009
Springer
Traditional boosting algorithms for the ranking problems usually employ the pairwise approach and convert the document rating preference into a binary-value label, like RankBoost....
229
click to vote
VLDB
2007
ACM
16 years 6 months ago
2007
ACM
Main memory cache performance continues to play an important role in determining the overall performance of object-oriented, object-relational and XML databases. An effective metho...