2432 search results - page 101 / 487 » Degrees and choice numbers |
158
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
Parallel computation of the adaptive lattice filtering algorithm is difficult due to the dependency problem caused by feedback operations. The conventional control-level paralle...
164
click to vote
COMPGEOM
2006
ACM
16 years 8 days ago
2006
ACM
Let S be a finite set of n + 3 points in general position in the plane, with 3 extreme points and n interior points. We consider triangulations drawn uniformly at random from the...
152
click to vote
ISSAC
2005
Springer
15 years 11 months ago
2005
Springer
We present algorithms that compute the linear and quadratic factors of supersparse (lacunary) bivariate polynomials over the rational numbers in polynomial-time in the input size....
184
click to vote
GECCO
1999
Springer
15 years 10 months ago
1999
Springer
This paper presents a study of parallel genetic algorithms (GAs) with multiple populations (also called demes or islands). The study makes explicit the relation between the probab...
161
click to vote
COMBINATORICS
2007
15 years 6 months ago
2007
A simple 2-matching in a graph is a subgraph all of whose nodes have degree 1 or 2. A simple 2-matching is called k-restricted if every connected component has > k edges. We co...