Sciweavers

2 search results - page 1 / 1
» Biased dictionaries with fast insert deletes
Sort
View
IPL
2007
101views more  IPL 2007»
13 years 8 months ago
Adjacency queries in dynamic sparse graphs
We deal with the problem of maintaining a dynamic graph so that queries of the form “is there an edge between u and v?” are processed fast. We consider graphs of bounded arbor...
Lukasz Kowalik
SERSCISA
2010
Springer
13 years 10 months ago
A Novel Approach Based on Fault Tolerance and Recursive Segmentation to Query by Humming
With the explosive growth of digital music, content-based music information retrieval especially query by humming/singing have been attracting more and more attention and are beco...
Xiaohong Yang, Qingcai Chen, Xiaolong Wang