1566 search results - page 71 / 314 » On a Cone Covering Problem |
180
click to vote
FUIN
2010
15 years 3 months ago
2010
In this paper we study decidability of several extensions of P/T nets with name creation and/or replication. In particular, we study how to restrict the models of RN systems (P/T n...
160
click to vote
KDD
2009
ACM
16 years 29 days ago
2009
ACM
In this paper, we consider a novel scheme referred to as Cartesian contour to concisely represent the collection of frequent itemsets. Different from the existing works, this sche...
142
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We study the problem of quantization of discrete probability distributions, arising in universal coding, as well as other applications. We show, that in many situations this probl...
150
click to vote
ASPDAC
2008
ACM
15 years 8 months ago
2008
ACM
A two-stage optimization methodology is proposed to solve the fixed-outline floorplanning problem that is a global optimization problem for wirelength minimization. In the first st...
156
click to vote
COMPGEOM
2008
ACM
15 years 8 months ago
2008
ACM
Generalizing the concept of a Reeb graph, the Reeb space of a multivariate continuous mapping identifies points of the domain that belong to a common component of the preimage of ...