5215 search results - page 874 / 1043 » Quantum clustering algorithms |
177
click to vote
SPIRE
2005
Springer
15 years 9 months ago
2005
Springer
Proximity searching consists in retrieving from a database, objects that are close to a query. For this type of searching problem, the most general model is the metric space, where...
157
click to vote
SIGIR
2004
ACM
15 years 9 months ago
2004
ACM
Document representation and indexing is a key problem for document analysis and processing, such as clustering, classification and retrieval. Conventionally, Latent Semantic Index...
152
click to vote
ISPA
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. Powerful grid and cluster computers allow efficient distributed simulation. Optimistic simulation techniques have been developed which allow for more parallelism in the l...
122
click to vote
IEEEPACT
2003
IEEE
15 years 9 months ago
2003
IEEE
Modern architecture research relies heavily on detailed pipeline simulation. Simulating the full execution of an industry standard benchmark can take weeks to months to complete. ...
119
click to vote
SPAA
2003
ACM
15 years 9 months ago
2003
ACM
Previous implementations of out-of-core columnsort limit the problem size to N ≤ (M/P)3/2, where N is the number of records to sort, P is the number of processors, and M is the ...