329 search results - page 25 / 66 » Efficient Parallel Query Processing by Graph Ranking |
ICDE
2009
IEEE
14 years 10 months ago
2009
IEEE
Due to the structural heterogeneity of XML, queries are often interpreted approximately. This is achieved by relaxing the query and ranking the results based on their relevance to ...
ACL
2000
13 years 9 months ago
2000
In terms of both speed and memory consumption, graph unification remains the most expensive component of unification-based grammar parsing. We present a technique to reduce the me...
SIPS
2007
IEEE
14 years 2 months ago
2007
IEEE
Stochastic decoding is a new alternative method for low complexity decoding of error-correcting codes. This paper presents the first hardware architecture for stochastic decoding...
ICEIS
2009
IEEE
14 years 3 months ago
2009
IEEE
Today XML is an essential technology for knowledge management within enterprises and dissemination of data over the Web. Therefore the efficient evaluation of XML queries has been ...
WEBI
2010
Springer
13 years 6 months ago
2010
Springer
Abstract--To make sure they can quickly respond to a specific query, the main search engines have several mechanisms. One of them consists in ranking web pages according to their i...