Sciweavers

935 search results - page 85 / 187
» Some Results on Orthogonal Factorizations
Sort
View
EJC
2011
14 years 1 months ago
A Tutte-style proof of Brylawski's tensor product formula
We provide a new proof of Brylawski’s formula for the Tutte polynomial of the tensor product of two matroids. Our proof involves extending Tutte’s formula, expressing the Tutte...
Yuanan Diao, Gábor Hetyei, Kenneth Hinson
CORR
2012
Springer
193views Education» more  CORR 2012»
13 years 5 months ago
Search versus Decision for Election Manipulation Problems
Most theoretical definitions about the complexity of manipulating elections focus on the decision problem of recognizing which instances can be successfully manipulated, rather t...
Edith Hemaspaandra, Lane A. Hemaspaandra, Curtis M...
SIGKDD
2010
151views more  SIGKDD 2010»
14 years 4 months ago
Limitations of matrix completion via trace norm minimization
In recent years, compressive sensing attracts intensive attentions in the field of statistics, automatic control, data mining and machine learning. It assumes the sparsity of the ...
Xiaoxiao Shi, Philip S. Yu
WWW
2007
ACM
15 years 10 months ago
Identifying ambiguous queries in web search
It is widely believed that some queries submitted to search engines are by nature ambiguous (e.g., java, apple). However, few studies have investigated the questions of "how ...
Ruihua Song, Zhenxiao Luo, Ji-Rong Wen, Yong Yu, H...
STOC
2009
ACM
167views Algorithms» more  STOC 2009»
15 years 10 months ago
On the complexity of communication complexity
We consider the following question: given a two-argument boolean function f, represented as an N ? N binary matrix, how hard is to determine the (deterministic) communication comp...
Eyal Kushilevitz, Enav Weinreb