Sciweavers

208 search results - page 27 / 42
» Improving Exploration in UCT Using Local Manifolds
Sort
View
NIPS
2007
15 years 16 days ago
A learning framework for nearest neighbor search
Can we leverage learning techniques to build a fast nearest-neighbor (ANN) retrieval data structure? We present a general learning framework for the NN problem in which sample que...
Lawrence Cayton, Sanjoy Dasgupta
CEC
2008
IEEE
15 years 5 months ago
A Quantum-inspired Genetic Algorithm for data clustering
—The conventional K-Means clustering algorithm must know the number of clusters in advance and the clustering result is sensitive to the selection of the initial cluster centroid...
Jing Xiao, YuPing Yan, Ying Lin, Ling Yuan, Jun Zh...
CGF
2010
118views more  CGF 2010»
14 years 11 months ago
The Readability of Path-Preserving Clusterings of Graphs
Graph visualization systems often exploit opaque metanodes to reduce visual clutter and improve the readability of large graphs. This filtering can be done in a path-preserving wa...
Daniel Archambault, Helen C. Purchase, Bruno Pinau...
PLDI
1999
ACM
15 years 3 months ago
Cache-Conscious Structure Layout
Hardware trends have produced an increasing disparity between processor speeds and memory access times. While a variety of techniques for tolerating or reducing memory latency hav...
Trishul M. Chilimbi, Mark D. Hill, James R. Larus
BMCBI
2011
14 years 2 months ago
Conotoxin Protein Classification Using Free Scores of Words and Support Vector Machines
Background: Conotoxin has been proven to be effective in drug design and could be used to treat various disorders such as schizophrenia, neuromuscular disorders and chronic pain. ...
Nazar Zaki, Stefan Wolfsheimer, Grégory Nue...