Sciweavers

157 search results - page 18 / 32
» A reduction of the NF consistency problem
Sort
View
JMLR
2006
148views more  JMLR 2006»
14 years 9 months ago
Computational and Theoretical Analysis of Null Space and Orthogonal Linear Discriminant Analysis
Dimensionality reduction is an important pre-processing step in many applications. Linear discriminant analysis (LDA) is a classical statistical approach for supervised dimensiona...
Jieping Ye, Tao Xiong
SIGCOMM
2012
ACM
13 years 2 days ago
Reduction-based analysis of BGP systems with BGPVerif
Today’s inter-domain routing protocol, the Border Gateway Protocol (BGP), is increasingly complicated and fragile due to policy misconfiguration by individual autonomous system...
Anduo Wang, Alexander J. T. Gurney, Xianglong Han,...
FOCS
2006
IEEE
15 years 3 months ago
On the Compressibility of NP Instances and Cryptographic Applications
We study compression that preserves the solution to an instance of a problem rather than preserving the instance itself. Our focus is on the compressibility of NP decision problem...
Danny Harnik, Moni Naor
70
Voted
INFOCOM
2010
IEEE
14 years 8 months ago
Cooperative Boundary Detection for Spectrum Sensing Using Dedicated Wireless Sensor Networks
Abstract—Spectrum sensing is one of the key enabling technologies in Cognitive Radio Networks (CRNs). In CRNs, secondary users (SUs) are allowed to exploit the spectrum opportuni...
Yanyan Yang, Yunhuai Liu, Qian Zhang, Lionel M. Ni
TAMC
2007
Springer
15 years 3 months ago
On Deciding Deep Holes of Reed-Solomon Codes
For generalized Reed-Solomon codes, it has been proved [7] that the problem of determining if a received word is a deep hole is coNP-complete. The reduction relies on the fact that...
Qi Cheng, Elizabeth Murray