Sciweavers

115 search results - page 5 / 23
» The Complexity of List Ranking of Trees
Sort
View
WEBDB
2010
Springer
167views Database» more  WEBDB 2010»
15 years 3 months ago
Tree patterns with Full Text Search
Tree patterns with full text search form the core of both XQuery Full Text and the NEXI query language. On such queries, users expect a relevance-ranked list of XML elements as an...
Maria-Hendrike Peetz, Maarten Marx
ICALP
2001
Springer
15 years 2 months ago
Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness
We consider the quantum complexities of the following three problems: searching an ordered list, sorting an un-ordered list, and deciding whether the numbers in a list are all dis...
Peter Høyer, Jan Neerbek, Yaoyun Shi
ISAAC
2007
Springer
146views Algorithms» more  ISAAC 2007»
15 years 4 months ago
Bounded Tree-Width and CSP-Related Problems
We study the complexity of structurally restricted homomorphism and constraint satisfaction problems. For every class of relational structures C, let LHOM(C, _) be the problem of d...
Tommy Färnqvist, Peter Jonsson
DCC
2006
IEEE
15 years 4 months ago
A Fast and Low Complexity Image Codec based on Backward Coding of Wavelet Trees
A new approach of backward coding of wavelet trees (BCWT) is presented. Contrary to the common “forward” coding of wavelet trees from the highest level (lowest resolution), th...
Jiangling Guo, Sunanda Mitra, Brian Nutter, Tanja ...
IPPS
2006
IEEE
15 years 4 months ago
Concurrent counting is harder than queuing
In both distributed counting and queuing, processors in a distributed system issue operations which are organized into a total order. In counting, each processor receives the rank...
Srikanta Tirthapura, Costas Busch