Sciweavers

539 search results - page 73 / 108
» An Improved Upper Bound for SAT
Sort
View
TOCL
2008
102views more  TOCL 2008»
13 years 7 months ago
Flat and one-variable clauses: Complexity of verifying cryptographic protocols with single blind copying
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...
Helmut Seidl, Kumar Neeraj Verma
AROBOTS
2004
93views more  AROBOTS 2004»
13 years 7 months ago
Propagation of Uncertainty in Cooperative Multirobot Localization: Analysis and Experimental Results
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...
Stergios I. Roumeliotis, Ioannis M. Rekleitis
COMBINATORICA
2004
48views more  COMBINATORICA 2004»
13 years 7 months ago
Linear Discrepancy of Totally Unimodular Matrices
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...
Benjamin Doerr
VTC
2010
IEEE
146views Communications» more  VTC 2010»
13 years 6 months ago
Multi-User Channel Estimation for Interference Mitigation in the LTE-Advanced Uplink
—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...
Zhijun Rong, Gerhard Fettweis
ALGORITHMICA
2011
13 years 2 months ago
Crossing Number and Weighted Crossing Number of Near-Planar Graphs
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...
Sergio Cabello, Bojan Mohar