Sciweavers

238 search results - page 20 / 48
» Exploiting Hybrid Parallelism in Web Search Engines
Sort
View
IJWET
2010
83views more  IJWET 2010»
13 years 5 months ago
Technically approaching the semantic web bottleneck
: After several years of research, the fundamental Semantic Web technologies have reached a high maturity level. Nevertheless, the average Web user has not yet taken advantage of t...
Nikolaos Konstantinou, Dimitrios-Emmanuel Spanos, ...
W2GIS
2007
Springer
14 years 1 months ago
Towards the Geo-spatial Querying of the Semantic Web with ONTOAST
One of the challenges raised by the construction of the semantic Web lies in the analysis and management of complex relationships (thematic, spatial and temporal) connecting severa...
Alina Dia Miron, Jérôme Gensel, Marl&...
DAC
2008
ACM
14 years 8 months ago
Design of high performance pattern matching engine through compact deterministic finite automata
Pattern matching relies on deterministic finite automata (DFA) to search for predefined patterns. While a bit-DFA method is recently proposed to exploit the parallelism in pattern...
Piti Piyachon, Yan Luo
SIGIR
2010
ACM
13 years 11 months ago
Capturing page freshness for web search
Freshness has been increasingly realized by commercial search engines as an important criteria for measuring the quality of search results. However, most information retrieval met...
Na Dai, Brian D. Davison
PDP
2006
IEEE
14 years 1 months ago
Parallel Adaptive Technique for Computing PageRank
Re-ranking the search results using PageRank is a well-known technique used in modern search engines. Running an iterative algorithm like PageRank on a large web graph consumes bo...
Arnon Rungsawang, Bundit Manaskasemsak