3208 search results - page 249 / 642 » A Lower Bound for Primality |
149
click to vote
LATIN
2010
Springer
16 years 1 months ago
2010
Springer
In this paper, we consider the problem of representing graphs by polygons whose sides touch. We show that at least six sides per polygon are necessary by constructing a class of pl...
129
click to vote
COMPGEOM
2009
ACM
16 years 1 months ago
2009
ACM
of Polyhedra: Limits of Abstraction Friedrich Eisenbrand∗ Nicolai Hähnle† Alexander Razborov‡ Thomas Rothvoߧ September 25, 2009 tigate the diameter of a natural abstract...
166
click to vote
ICASSP
2008
IEEE
16 years 1 months ago
2008
IEEE
Practical schemes for distributed video coding with side information at the decoder need to consider non-standard correlation models in order to take non-stationarities into accou...
191
click to vote
ICIC
2007
Springer
16 years 23 days ago
2007
Springer
Abstract. We study the approximation of the integration of multivariate functions classes in the quantum model of computation. We first obtain a lower bound of the n-th minimal qu...
185
click to vote
ACSC
2005
IEEE
16 years 8 days ago
2005
IEEE
A k-separated matching in a graph is a set of edges at distance at least k from one another (hence, for instance, a 1-separated matching is just a matching in the classical sense)...