496 search results - page 82 / 100 » Machine models and lower bounds for query processing |
SIGSOFT
2003
ACM
14 years 8 months ago
2003
ACM
Automated finite-state verification techniques have matured considerably in the past several years, but state-space explosion remains an obstacle to their use. Theoretical lower b...
ENTCS
2008
13 years 7 months ago
2008
ion in PRISM1 Mark Kattenbelt Marta Kwiatkowska Gethin Norman David Parker Oxford University Computing Laboratory, Oxford, UK Modelling and verification of systems such as communi...
TDSC
2010
13 years 2 months ago
2010
Network survivability is the ability of a network keeping connected under failures and attacks, which is a fundamental issue to the design and performance evaluation of wireless ad...
WSDM
2009
ACM
14 years 2 months ago
2009
ACM
Recently the re-ranking algorithms have been quite popular for web search and data mining. However, one of the issues is that those algorithms treat the content and link informati...
SIGIR
2010
ACM
13 years 11 months ago
2010
ACM
Ranking search results is a fundamental problem in information retrieval. In this paper we explore whether the use of proximity and phrase information can improve web retrieval ac...