963 search results - page 52 / 193 » On Computation of Performance Bounds of Optimal Index Assign... |
106
click to vote
ICML
1998
IEEE
16 years 19 days ago
1998
IEEE
In this work, we present a new bottom-up algorithmfor decision tree pruning that is very e cient requiring only a single pass through the given tree, and prove a strong performanc...
102
click to vote
SAC
2006
ACM
15 years 5 months ago
2006
ACM
This paper introduces the MTree index algorithm, a special purpose XML XPath index designed to meet the needs of the hierarchical XPath query language. With the increasing importa...
IPPS
2006
IEEE
15 years 5 months ago
2006
IEEE
This paper exploits a previously developed analytical modeling framework to compare several variations of the basic flooding search strategy in unstructured decentralized peer-to...
STACS
2007
Springer
15 years 6 months ago
2007
Springer
We study the following problem. Given a weighted planar graph G, assign labels L(v) to vertices so that given L(u), L(v) and L(x) for x ∈ X for any X ⊂ V (G), compute the dist...
MOBIHOC
2009
ACM
16 years 11 days ago
2009
ACM
Due to its low complexity, Greedy Maximal Scheduling (GMS), also known as Longest Queue First (LQF), has been studied extensively for wireless networks. However, GMS can result in...