Sciweavers

1920 search results - page 69 / 384
» The Complexity of the A B C Problem
Sort
View
175
Voted
MOBISYS
2011
ACM
14 years 9 months ago
ProxiMate: proximity-based secure pairing using ambient wireless signals
Forming secure associations between wireless devices that do not share a prior trust relationship is an important problem. This paper presents ProxiMate, a system that allows wire...
Suhas Mathur, Robert C. Miller, Alexander Varshavs...
160
Voted
NGC
2000
Springer
15 years 9 months ago
The use of hop-limits to provide survivable ATM group communications
We examine the use of a hop-limit constraint with techniques to provide survivability for connection-oriented ATM group communications. A hop-limit constraint is an approach that ...
William Yurcik, David Tipper, Deep Medhi
VTC
2008
IEEE
127views Communications» more  VTC 2008»
16 years 14 days ago
A Low-Complexity Precoder for Large Multiuser MISO Systems
—In this paper, we consider the problem of precoding in large multiuser MISO systems, where by ‘large’ we mean i) large number of transmit antennas (Nt) at the base station o...
Saif K. Mohammed, Ananthanarayanan Chockalingam, B...
FOCS
2007
IEEE
16 years 13 days ago
Parameterized Proof Complexity
We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixedparameter tractable. We consider proofs that witness that a given prop...
Stefan S. Dantchev, Barnaby Martin, Stefan Szeider
DAC
2009
ACM
16 years 7 months ago
Handling complexities in modern large-scale mixed-size placement
In this paper, we propose an effective algorithm flow to handle largescale mixed-size placement. The basic idea is to use floorplanning to guide the placement of objects at the gl...
Jackey Z. Yan, Natarajan Viswanathan, Chris Chu