Sciweavers

3415 search results - page 119 / 683
» Lower Bounds for Kernelizations
Sort
View
ICASSP
2011
IEEE
14 years 8 months ago
Subspace-based DOA estimation using Fractional Lower Order statistics
Direction Of Arrival (DOA) estimation, using a sensor array, in the presence of non-Gaussian noise using Fractional Lower-Order Moments (FLOM)matrices is studied. In this paper, a...
K. V. S. Hari, V. Lalitha
JMLR
2006
143views more  JMLR 2006»
15 years 4 months ago
Consistency and Convergence Rates of One-Class SVMs and Related Algorithms
We determine the asymptotic behaviour of the function computed by support vector machines (SVM) and related algorithms that minimize a regularized empirical convex loss function i...
Régis Vert, Jean-Philippe Vert
INFOCOM
2009
IEEE
15 years 11 months ago
Delay Analysis for Multi-Hop Wireless Networks
Abstract—We analyze the delay performance of a multihop wireless network with a fixed route between each sourcedestination pair. There are arbitrary interference constraints on ...
Gagan Rajesh Gupta, Ness B. Shroff
TCC
2007
Springer
92views Cryptology» more  TCC 2007»
15 years 10 months ago
One-Way Permutations, Interactive Hashing and Statistically Hiding Commitments
We present a lower bound on the round complexity of a natural class of black-box constructions of statistically hiding commitments from one-way permutations. This implies a Ω( n ...
Hoeteck Wee
CPAIOR
2005
Springer
15 years 9 months ago
Filtering Algorithms for the NValue Constraint
Abstract. The NValue constraint counts the number of different values assigned to a vector of variables. Propagating generalized arc consistency on this constraint is NP-hard. We ...
Christian Bessière, Emmanuel Hebrard, Brahi...