Sciweavers

7228 search results - page 436 / 1446
» From Algorithmic to Subjective Randomness
Sort
View
FOCS
2000
IEEE
15 years 11 months ago
On the Hardness of Graph Isomorphism
We show that the graph isomorphism problem is hard under DLOGTIME uniform AC0 many-one reductions for the complexity classes NL, PL (probabilistic logarithmic space) for every loga...
Jacobo Torán
190
Voted
ICASSP
2010
IEEE
15 years 7 months ago
A nullspace analysis of the nuclear norm heuristic for rank minimization
The problem of minimizing the rank of a matrix subject to linear equality constraints arises in applications in machine learning, dimensionality reduction, and control theory, and...
Krishnamurthy Dvijotham, Maryam Fazel
TON
1998
63views more  TON 1998»
15 years 6 months ago
On variations of queue response for inputs with the same mean and autocorrelation function
— This paper explores the variations in mean queue length for stationary arrival processes with the same mean and autocorrelation functions, or equivalently, the same mean and po...
Bruce Hajek, Linhai He
JAIR
2010
99views more  JAIR 2010»
15 years 5 months ago
Developing Approaches for Solving a Telecommunications Feature Subscription Problem
Call control features (e.g., call-divert, voice-mail) are primitive options to which users can subscribe off-line to personalise their service. The configuration of a feature su...
David Lesaint, Deepak Mehta, Barry O'Sullivan, Lui...
TRANSCI
2010
101views more  TRANSCI 2010»
15 years 1 months ago
The Effect of Supply Disruptions on Supply Chain Design Decisions
We study an integrated supply chain design problem that determines the locations of retailers and the assignments of customers to retailers in order to minimize the expected costs...
Lian Qi, Zuo-Jun Max Shen, Lawrence V. Snyder