Sciweavers

1520 search results - page 184 / 304
» Class Hierarchy Specialization
Sort
View
CORR
2010
Springer
100views Education» more  CORR 2010»
13 years 8 months ago
Shortest paths between shortest paths and independent sets
We study problems of reconguration of shortest paths in graphs. We prove that the shortest reconguration sequence can be exponential in the size of the graph and that it is NP-hard...
Marcin Kaminski, Paul Medvedev, Martin Milanic
CORR
2008
Springer
115views Education» more  CORR 2008»
13 years 8 months ago
Adaptive Sum Power Iterative Waterfilling for MIMO Cognitive Radio Channels
Abstract--In this paper, the sum capacity of the Gaussian Multiple Input Multiple Output (MIMO) Cognitive Radio Channel (MCC) is expressed as a convex problem with finite number of...
Rajiv Soundararajan, Sriram Vishwanath
CSDA
2010
94views more  CSDA 2010»
13 years 8 months ago
Implementing Bayesian predictive procedures: The K-prime and K-square distributions
The implementation of Bayesian predictive procedures under standard normal models is considered. Two distributions are of particular interest, the K-prime and Ksquare distribution...
Jacques Poitevineau, Bruno Lecoutre
DISOPT
2008
113views more  DISOPT 2008»
13 years 8 months ago
The inverse 1-median problem on a cycle
Abstract. Let the graph G = (V, E) be a cycle with n + 1 vertices, nonnegative vertex weights and positive edge lengths. The inverse 1-median problem on a cycle consists in changin...
Rainer E. Burkard, Carmen Pleschiutschnig, Jianzho...
ECCC
2008
98views more  ECCC 2008»
13 years 8 months ago
Public-Key Cryptosystems from the Worst-Case Shortest Vector Problem
We construct public-key cryptosystems that are secure assuming the worst-case hardness of approximating the minimum distance on n-dimensional lattices to within small poly(n) fact...
Chris Peikert