740 search results - page 117 / 148 » Lower bounds for Buchsbaum* complexes |
154
click to vote
STACS
2007
Springer
16 years 8 days ago
2007
Springer
A coloring of a graph is convex if it induces a partition of the vertices into connected subgraphs. Besides being an interesting property from a theoretical point of view, tests f...
163
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
Classical problems of sorting and searching assume an underlying linear ordering of the objects being compared. In this paper, we study a more general setting, in which some pairs...
159
click to vote
KDD
2009
ACM
16 years 28 days ago
2009
ACM
In this paper we propose a utility model that accounts for both sales and branding advertisers. We first study the computational complexity of optimization problems related to bo...
143
click to vote
ICC
2007
IEEE
16 years 15 days ago
2007
IEEE
— The paper deals with the problem of the carrier frequency-offset (CFO) estimation for wireless communications. Since the well-known maximum-likelihood (ML) CFO estimator is rat...
144
click to vote
COCO
2005
Springer
15 years 11 months ago
2005
Springer
We continue the study of noncommutative polynomial identity testing initiated by Raz and Shpilka and present efficient algorithms for the following problems in the noncommutative...