844 search results - page 31 / 169 » Solving the p |
CONEXT
2008
ACM
14 years 11 months ago
2008
ACM
In peer-to-peer (P2P) systems, a receiver needs to be matched with multiple senders, because peers have limited capacity and reliability. Efficient peer matching can reduce the co...
IPL
2000
14 years 9 months ago
2000
Given a polyhedron P by a list of inequalities we develop unbiased estimates of the number of vertices and bases of P. The estimates are based on applying tree estimation methods ...
COMPGEOM
2004
ACM
15 years 3 months ago
2004
ACM
Let P be a set of n points in Ê3 , not all in a common plane. We solve a problem of Scott (1970) by showing that the connecting lines of P assume at least 2n − 7 different dir...
CORR
2007
Springer
14 years 9 months ago
2007
Springer
Let PCSN p denote a set of p binary sequences of length N such that the sum of their periodic auto-correlation functions is a δ-function. In the 1990, B¨omer and Antweiler addres...
IANDC
1998
14 years 9 months ago
1998
We show that restricting a number of characterizations of the complexity class P to be positive (in natural ways) results in the same class of (monotone) problems which we denote ...