675 search results - page 88 / 135 » Biased Range Trees |
ICDM
2008
IEEE
15 years 5 months ago
2008
IEEE
Supervised approaches to Data Mining are particularly appealing as they allow for the extraction of complex relations from data objects. In order to facilitate their application i...
ICMCS
2008
IEEE
15 years 5 months ago
2008
IEEE
The existing DONet-based approach uses successfully a random gossip algorithm for scalable live video streaming. This pure mesh overlay network-based solution may lead to unaccept...
SPIRE
2005
Springer
15 years 4 months ago
2005
Springer
Output-sensitive data structures result from preprocessing n items and are capable of reporting the items satisfying an on-line query in O(t(n) + ℓ) time, where t(n) is the cost ...
EXTREME
2004
ACM
15 years 4 months ago
2004
ACM
Overlap in markup occurs where some markup structures do not nest, such as where the sentence and phrase boundaries of a poem and the metrical line structure describe different hi...
101
click to vote
SPAA
2004
ACM
15 years 4 months ago
2004
ACM
The literature describes two high performance concurrent stack algorithms based on combining funnels and elimination trees. Unfortunately, the funnels are linearizable but blockin...