1007 search results - page 93 / 202 » Worst-Case Optimal Algorithms for Parallel Query Processing |
131
click to vote
CIKM
2004
Springer
15 years 8 months ago
2004
Springer
The performance of web search engines may often deteriorate due to the diversity and noisy information contained within web pages. User click-through data can be used to introduce...
115
click to vote
PROCEDIA
2010
15 years 1 months ago
2010
This study is devoted to exploring possible applications of GPU technology for acceleration of the database access. We use the n-gram based approximate text search engine as a tes...
133
click to vote
CP
2010
Springer
15 years 26 days ago
2010
Springer
We introduce a parallelized version of tree-decomposition based dynamic programming for solving difficult weighted CSP instances on many cores. A tree decomposition organizes cost ...
121
click to vote
ISPA
2004
Springer
15 years 8 months ago
2004
Springer
The demand of information services is popular in recent years. However, the requested of correct answer in a mobile environment needs to have more attentions. This is due to the sc...
117
click to vote
IPPS
2006
IEEE
15 years 9 months ago
2006
IEEE
As an extension of Bayesian network, module network is an appropriate model for inferring causal network of a mass of variables from insufficient evidences. However learning such ...