Sciweavers

439 search results - page 84 / 88
» Neighborhood Structures for GPU-Based Local Search Algorithm...
Sort
View
KDD
2001
ACM
203views Data Mining» more  KDD 2001»
14 years 8 months ago
Ensemble-index: a new approach to indexing large databases
The problem of similarity search (query-by-content) has attracted much research interest. It is a difficult problem because of the inherently high dimensionality of the data. The ...
Eamonn J. Keogh, Selina Chu, Michael J. Pazzani
GECCO
2003
Springer
14 years 21 days ago
Enhancing the Performance of GP Using an Ancestry-Based Mate Selection Scheme
The performance of genetic programming relies mostly on population-contained variation. If the population diversity is low then there will be a greater chance of the algorithm bein...
Rodney Fry, Andrew M. Tyrrell
PPOPP
2010
ACM
14 years 4 months ago
A distributed placement service for graph-structured and tree-structured data
Effective data placement strategies can enhance the performance of data-intensive applications implemented on high end computing clusters. Such strategies can have a significant i...
Gregory Buehrer, Srinivasan Parthasarathy, Shirish...
SIGMOD
2010
ACM
255views Database» more  SIGMOD 2010»
14 years 9 days ago
Indexing multi-dimensional data in a cloud system
Providing scalable database services is an essential requirement for extending many existing applications of the Cloud platform. Due to the diversity of applications, database ser...
Jinbao Wang, Sai Wu, Hong Gao, Jianzhong Li, Beng ...
LREC
2010
180views Education» more  LREC 2010»
13 years 9 months ago
Parsing to Stanford Dependencies: Trade-offs between Speed and Accuracy
We investigate a number of approaches to generating Stanford Dependencies, a widely used semantically-oriented dependency representation. We examine algorithms specifically design...
Daniel Cer, Marie-Catherine de Marneffe, Daniel Ju...