1451 search results - page 2 / 291 » Order independence and rationalizability |
SIAMDM
2010
13 years 5 days ago
2010
Let G be a graph with n vertices and independence number . Hadwiger's conjecture implies that G contains a clique minor of order at least n/. In 1982, Duchet and Meyniel prov...
ASIACRYPT
2010
Springer
13 years 3 months ago
2010
Springer
sion of an extended abstract published in Proceedings of Asiacrypt 2010, Springer-Verlag, 2010. Available from the IACR Cryptology ePrint Archive as Report 2010/474. Beginning wit...
TIT
2008
13 years 4 months ago
2008
Abstract--In most previously reported studies on locally optimum detection of signals, independent observations have been assumed in various noise environments. The use of an indep...
PR
2000
13 years 5 months ago
2000
The problem of the independence and completeness of rotation moment invariants is addressed in this paper. First, a general method for constructing invariants of arbitrary orders ...
DM
1999
13 years 5 months ago
1999
Abstract. Given a partially ordered set P = (X; P ), a function F which assigns to each x 2 X a set F (x) so that x y in P if and only if F (x) F (y) is called an inclusion represe...