85 search results - page 8 / 17 » Complexity of some Path Problems in DAGs and Linear Orders |
167
click to vote
DATE
2010
IEEE
15 years 11 months ago
2010
IEEE
—1 In this paper we present a stochastic model order reduction technique for interconnect extraction in the presence of process variabilities, i.e. variation-aware extraction. It...
145
click to vote
IPPS
2009
IEEE
16 years 19 days ago
2009
IEEE
In this paper, we explore the problem of mapping filtering services on large-scale heterogeneous platforms. Two important optimization criteria should be considered in such a fra...
164
click to vote
ICDM
2007
IEEE
16 years 9 days ago
2007
IEEE
We consider the problem of elastic matching of sequences of real numbers. Since both a query and a target sequence may be noisy, i.e., contain some outlier elements, it is desirab...
137
click to vote
CCA
2009
Springer
16 years 17 days ago
2009
Springer
It is folklore particularly in numerical and computer sciences that, instead of solving some general problem f : A → B, additional structural information about the input x ∈ A ...
165
click to vote
MFCS
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. To make a joint decision, agents (or voters) are often required to provide their preferences as linear orders. To determine a winner, the given linear orders can be aggre...