1672 search results - page 145 / 335 » Tightness problems in the plane |
84
Voted
CORR
2008
Springer
14 years 9 months ago
2008
Springer
We consider the problem of source coding with receiver side information for the simple network proposed by R. Gray and A. Wyner in 1974. In this network, a transmitter must reliabl...
DLOG
2010
14 years 9 months ago
2010
In this paper, we revisit the problem of definitorial completeness, i.e., whether a given general TBox T in a description logic (DL) L can be rewritten to an acyclic TBox T in L . ...
CORR
2010
Springer
14 years 8 months ago
2010
Springer
An old problem of Moser asks: how large of a union-free subfamily does every family of m sets have? A family of sets is called union-free if there are no three distinct sets in th...
110
click to vote
RSA
2011
14 years 6 months ago
2011
: The classical result in the theory of random graphs, proved by Erd˝os and Rényi in 1960, concerns the threshold for the appearance of the giant component in the random graph pr...
IEEEVAST
2010
14 years 6 months ago
2010
Optimization problems are typically addressed by purely automatic approaches. For multi-objective problems, however, a single best solution often does not exist. In this case, it ...