Sciweavers

8953 search results - page 263 / 1791
» Parallel Query Processing
Sort
View
CONCUR
2010
Springer
15 years 4 months ago
Bisimilarity of One-Counter Processes Is PSPACE-Complete
A one-counter automaton is a pushdown automaton over a singleton stack alphabet. We prove that the bisimilarity of processes generated by nondeterministic one-counter automata (wit...
Stanislav Böhm, Stefan Göller, Petr Janc...
SIGIR
2009
ACM
15 years 9 months ago
Compressing term positions in web indexes
Large search engines process thousands of queries per second on billions of pages, making query processing a major factor in their operating costs. This has led to a lot of resear...
Hao Yan, Shuai Ding, Torsten Suel
INFOCOM
2006
IEEE
15 years 9 months ago
Performance of Full Text Search in Structured and Unstructured Peer-to-Peer Systems
— While structured P2P systems (such as DHTs) are often regarded as an improvement over unstructured P2P systems (such as super-peer networks) in terms of routing efficiency, it...
Yong Yang, Rocky Dunlap, Mike Rexroad, Brian F. Co...
CORR
2002
Springer
88views Education» more  CORR 2002»
15 years 3 months ago
SPINning Parallel Systems Software
We describe our experiences in using Spin to verify parts of the Multi Purpose Daemon (MPD) parallel process management system. MPD is a distributed collection of processes connect...
Olga Shumsky Matlin, Ewing L. Lusk, William McCune
ICCHP
2010
Springer
15 years 8 months ago
PUIR: Parallel User Interface Rendering
Abstract. While providing non-visual access to graphical user interfaces has been the topic of research for over 20 years, blind users still face many obstacles when using computer...
Kris Van Hees, Jan Engelen