104 search results - page 17 / 21 » Dependency trees in sub-linear time and bounded memory |
INFOCOM
2009
IEEE
14 years 3 months ago
2009
IEEE
Currently, the increasing rate of routing lookups in Internet routers, the large number of prefixes and also the transition from IPV4 to IPV6, have caused Internet designers to pro...
TCBB
2010
13 years 3 months ago
2010
Recent techniques increase rapidly the amount of our knowledge on interactions between proteins. The interpretation of these new information depends on our ability to retrieve kno...
VLDB
1997
ACM
14 years 28 days ago
1997
ACM
The cpquantile of an ordered sequenceof data values is the element with rank ‘pn, where n is the total number of values. Accurate estimates of quantiles are required for the sol...
EUMAS
2006
13 years 10 months ago
2006
Forming effective coalitions is a major research challenge in the field of multi-agent systems. Central to this endeavour is the problem of determining the best set of agents that...
ICDE
2008
IEEE
14 years 10 months ago
2008
IEEE
Abstract-- Current twig join algorithms incur high memory costs on queries that involve child-axis nodes. In this paper we provide an analytical explanation for this phenomenon. In...