251 search results - page 50 / 51 » Constructive Linear Time Algorithms for Branchwidth |
ICFP
2004
ACM
14 years 10 months ago
2004
ACM
Useful type inference must be faster than normalization. Otherwise, you could check safety conditions by running the program. We analyze the relationship between bounds on normali...
ICC
2007
IEEE
14 years 5 months ago
2007
IEEE
—Burst loss and delay are two main issues in optical hop-count. Network diameter is the hop-count of the shortest burst switching (OBS) networks. In OBS, if the hop-count path be...
SIGSOFT
2007
ACM
14 years 11 months ago
2007
ACM
The standard language for describing the asymptotic behavior of algorithms is theoretical computational complexity. We propose a method for describing the asymptotic behavior of p...
PEPM
2010
ACM
14 years 7 months ago
2010
ACM
We show how to efficiently evaluate generic map-filter-product queries, generalizations of select-project-join (SPJ) queries in relational algebra, based on a combination of two...
QEST
2008
IEEE
14 years 5 months ago
2008
IEEE
We begin by observing that (discrete-time) QuasiBirth-Death Processes (QBDs) are equivalent, in a precise sense, to (discrete-time) probabilistic 1-Counter Automata (p1CAs), and b...