323 search results - page 24 / 65 » Exact Approximations of omega Numbers |
106
click to vote
WAOA
2005
Springer
15 years 3 months ago
2005
Springer
Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most...
SIGMOD
1999
ACM
15 years 2 months ago
1999
ACM
Computing multidimensional aggregates in high dimensions is a performance bottleneck for many OLAP applications. Obtaining the exact answer to an aggregation query can be prohibit...
CORR
2010
Springer
14 years 8 months ago
2010
Springer
The neighbourhood function NG(t) of a graph G gives, for each t ∈ N, the number of pairs of nodes x, y such that y is reachable from x in less that t hops. The neighbourhood fun...
BMCBI
2010
14 years 9 months ago
2010
Background: Large datasets of protein interactions provide a rich resource for the discovery of Short Linear Motifs (SLiMs) that recur in unrelated proteins. However, existing met...
81
Voted
IOR
2006
14 years 9 months ago
2006
This paper studies the M/M/s+M queue, i.e., the M/M/s queue with customer abandonment, also called the Erlang-A model, having independent and identically distributed customer aban...