Sciweavers

371 search results - page 23 / 75
» Computation of the Minimal Associated Primes
Sort
View
ICS
2000
Tsinghua U.
13 years 11 months ago
A low-complexity issue logic
One of the main concerns in today's processor design is the issue logic. Instruction-level parallelism is usually favored by an out-of-order issue mechanism where instruction...
Ramon Canal, Antonio González
ICASSP
2011
IEEE
12 years 11 months ago
Adaptive N-normalization for enhancing music similarity
The N-Normalization is an efficient method for normalizing a given similarity computed among multimedia objects. It can be considered for clustering and kernel enhancement. Howev...
Mathieu Lagrange, George Tzanetakis
CPHYSICS
2008
121views more  CPHYSICS 2008»
13 years 7 months ago
A scalable parallel algorithm for large-scale reactive force-field molecular dynamics simulations
A scalable parallel algorithm has been designed to perform multimillion-atom molecular dynamics (MD) simulations, in which first principlesbased reactive force fields (ReaxFF) des...
Ken-ichi Nomura, Rajiv K. Kalia, Aiichiro Nakano, ...
ACMSE
2005
ACM
14 years 1 months ago
The bipartite clique: a topological paradigm for WWWeb user search customization
Web user search customization research has been fueled by the recognition that if the WWW is to attain to its optimal potential as an interactive medium the development of new and...
Brenda F. Miles, Vir V. Phoha
NIPS
2001
13 years 8 months ago
Spectral Relaxation for K-means Clustering
The popular K-means clustering partitions a data set by minimizing a sum-of-squares cost function. A coordinate descend method is then used to nd local minima. In this paper we sh...
Hongyuan Zha, Xiaofeng He, Chris H. Q. Ding, Ming ...