539 search results - page 73 / 108 » An Improved Upper Bound for SAT |
115
click to vote
TOCL
2008
14 years 11 months ago
2008
Cryptographic protocols with single blind copying were defined and modeled by Comon and Cortier using the new class C of first order clauses, which extends the Skolem class. They s...
AROBOTS
2004
2004
Propagation of Uncertainty in Cooperative Multirobot Localization: Analysis and Experimental Results
14 years 11 months ago
This paper examines the problem of cooperative localization for the case of large groups of mobile robots. A Kalman filter estimator is implemented and tested for this purpose. The...
COMBINATORICA
2004
14 years 11 months ago
2004
Let p [1, [ and cp = maxa[0,1]((1 - a)ap + a(1 - a)p)1/p. We prove that the known upper bound lindiscp(A) cp for the Lp linear discrepancy of a totally unimodular matrix A is as...
VTC
2010
IEEE
14 years 10 months ago
2010
IEEE
—We discuss a novel pilot design for multi-user channel estimation in the OFDM uplink with localized block-type pilot placement. Due to this placement, multiple users’ channels...
111
click to vote
ALGORITHMICA
2011
14 years 6 months ago
2011
A nonplanar graph G is near-planar if it contains an edge e such that G−e is planar. The problem of determining the crossing number of a near-planar graph is exhibited from diffe...