2432 search results - page 22 / 487 » Degrees and choice numbers |
ANTS
2008
Springer
13 years 11 months ago
2008
Springer
We present an algorithm that, on input of a CM-field K, an integer k 1, and a prime r 1 mod k, constructs a q-Weil number OK corresponding to an ordinary, simple abelian variety ...
PROPERTYTESTING
2010
13 years 7 months ago
2010
How well can the maximum size of an independent set, or the minimum size of a dominating set of a graph in which all degrees are at most d be approximated by a randomized constant...
ICCAD
2008
IEEE
14 years 6 months ago
2008
IEEE
— This paper presents a fast analytical method for estimating the throughput of pipelined asynchronous systems, and then applies that method to develop a fast solution to the pro...
SISAP
2008
IEEE
14 years 4 months ago
2008
IEEE
There are several pieces of information that can be utilized in order to improve the efficiency of similarity searches on high-dimensional data. The most commonly used information...
COMPGEOM
2010
ACM
14 years 2 months ago
2010
ACM
We study the expected number of interior vertices of degree i in a triangulation of a point set S, drawn uniformly at random from the set of all triangulations of S, and derive va...