233 search results - page 35 / 47 » Flows on Few Paths: Algorithms and Lower Bounds |
166
Voted
ICDE
2008
IEEE
15 years 11 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...
JDA
2006
14 years 9 months ago
2006
Traditionally, on-line problems have been studied under the assumption that there is a unique sequence of requests that must be served. This approach is common to most general mod...
SPAA
2009
ACM
15 years 10 months ago
2009
ACM
We consider the setting of a multiprocessor where the speeds of the m processors can be individually scaled. Jobs arrive over time and have varying degrees of parallelizability. A...
78
Voted
DATE
2009
IEEE
15 years 4 months ago
2009
IEEE
—Today, many chips are designed with predefined discrete cell libraries. In this paper we present a new fast gate sizing algorithm that works natively with discrete cell choices...
102
click to vote
CONCUR
1997
Springer
15 years 1 months ago
1997
Springer
We apply the symbolic analysis principle to pushdown systems. We represent (possibly in nite) sets of con gurations of such systems by means of nite-state automata. In order to re...