Sciweavers

784 search results - page 54 / 157
» Relaxing the Value Restriction
Sort
View
SIAMREV
2010
174views more  SIAMREV 2010»
13 years 4 months ago
Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
The affine rank minimization problem consists of finding a matrix of minimum rank that satisfies a given system of linear equality constraints. Such problems have appeared in the ...
Benjamin Recht, Maryam Fazel, Pablo A. Parrilo
CORR
2010
Springer
149views Education» more  CORR 2010»
13 years 10 months ago
Pebbling and Branching Programs Solving the Tree Evaluation Problem
We study restricted computation models related to the tree evaluation problem. The TEP was introduced in earlier work as a simple candidate for the (very) long term goal of separa...
Dustin Wehr
ICC
2007
IEEE
102views Communications» more  ICC 2007»
14 years 4 months ago
Accurate Performance Analysis of TR UWB Systems With Arbitrary Front-end Filters
—The sampling expansion approach for computing the performance of TR UWB systems has restricted validity and is very inaccurate in some cases. A new analytical method to evaluate...
Somasundaram Niranjayan, Norman C. Beaulieu
FORMATS
2007
Springer
14 years 4 months ago
Quantitative Model Checking Revisited: Neither Decidable Nor Approximable
Abstract. Quantitative model checking computes the probability values of a given property quantifying over all possible schedulers. It turns out that maximum and minimum probabilit...
Sergio Giro, Pedro R. D'Argenio
CSCLP
2005
Springer
14 years 3 months ago
Partitioning Based Algorithms for Some Colouring Problems
We discuss four variants of the graph colouring problem, and present algorithms for solving them. The problems are k-Colourability, Max Ind k-COL, Max Val k-COL, and, finally, Max...
Ola Angelsmark, Johan Thapper