Sciweavers

198 search results - page 12 / 40
» Tensor Rank: Some Lower and Upper Bounds
Sort
View
CORR
2010
Springer
99views Education» more  CORR 2010»
14 years 10 months ago
On Equivalence Between Network Topologies
One major open problem in network coding is to characterize the capacity region of a general multi-source multi-demand network. There are some existing computational tools for boun...
Michelle Effros, Tracey Ho, Shirin Jalali
CORR
2007
Springer
82views Education» more  CORR 2007»
14 years 10 months ago
Sorting and Selection with Random Costs
There is a growing body of work on sorting and selection in models other than the unit-cost comparison model. This work treats a natural stochastic variant of the problem where the...
Stanislav Angelov, Keshav Kunal, Andrew McGregor
AI
2005
Springer
14 years 10 months ago
First order LUB approximations: characterization and algorithms
One of the major approaches to approximation of logical theories is the upper and lower bounds approach introduced in (Selman and Kautz, 1991, 1996). In this paper, we address the...
Alvaro del Val
75
Voted
CORR
2006
Springer
77views Education» more  CORR 2006»
14 years 10 months ago
Quantization Bounds on Grassmann Manifolds and Applications to MIMO Communications
This paper considers the quantization problem on the Grassmann manifold Gn,p, the set of all p-dimensional planes (through the origin) in the n-dimensional Euclidean space. The ch...
Wei Dai, Youjian Liu, Brian Rider
CORR
2010
Springer
114views Education» more  CORR 2010»
14 years 4 months ago
Counting Unique-Sink Orientations
Unique-sink orientations (USOs) are an abstract class of orientations of the ncube graph. We consider some classes of USOs that are of interest in connection with the linear compl...
Jan Foniok, Bernd Gärtner, Lorenz Klaus, Mark...