Sciweavers

1945 search results - page 88 / 389
» Speeding up Serpent
Sort
View
PPL
2010
117views more  PPL 2010»
14 years 6 months ago
Neighborhood Structures for GPU-Based Local Search Algorithms
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
Thé Van Luong, Nouredine Melab, El-Ghazali ...
PROCEDIA
2010
138views more  PROCEDIA 2010»
14 years 6 months ago
Using the reconfigurable massively parallel architecture COPACOBANA 5000 for applications in bioinformatics
Currently several computational problems require high processing power to handle huge amounts of data, although underlying core algorithms appear to be rather simple. Especially i...
Lars Wienbrandt, Stefan Baumgart, Jost Bissel, Car...
PVLDB
2010
225views more  PVLDB 2010»
14 years 6 months ago
Efficient Processing of Top-k Spatial Preference Queries
Top-k spatial preference queries return a ranked set of the k best data objects based on the scores of feature objects in their spatial neighborhood. Despite the wide range of loc...
João B. Rocha-Junior, Akrivi Vlachou, Chris...
SIAMJO
2010
87views more  SIAMJO 2010»
14 years 6 months ago
Universal Rigidity and Edge Sparsification for Sensor Network Localization
Owing to their high accuracy and ease of formulation, there has been great interest in applying convex optimization techniques, particularly that of semidefinite programming (SDP)...
Zhisu Zhu, Anthony Man-Cho So, Yinyu Ye
TASLP
2010
106views more  TASLP 2010»
14 years 6 months ago
Efficient and Robust Music Identification With Weighted Finite-State Transducers
We present an approach to music identification based on weighted finite-state transducers and Gaussian mixture models, inspired by techniques used in large-vocabulary speech recogn...
Mehryar Mohri, Pedro Moreno, Eugene Weinstein