1857 search results - page 33 / 372 » Minimum Degree Orderings |
125
click to vote
FOSSACS
2004
Springer
16 years 1 days ago
2004
Springer
Abstract. In order to study relative PCF-definability of boolean functions, we associate a hypergraph Hf to any boolean function f (following [3, 5]). We introduce the notion of t...
208
click to vote
ICRA
2010
IEEE
15 years 5 months ago
2010
IEEE
Abstract— An estimation algorithm is developed for determining pitch and roll angles (tilt) of a rigid body fixed at a pivot using multiple accelerometers. The estimate is globa...
168
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We study Maker-Breaker games played on the edge set of a random graph. Specifically, we consider the random graph process and analyze the first time in a typical random graph proc...
176
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Let S = {si}iIN IN be a numerical semigroup. For si S, let (si) denote the number of pairs (si -sj, sj) S2 . When S is the Weierstrass semigroup of a family {Ci}iIN of one-point...
150
click to vote
ESA
2004
Springer
16 years 1 days ago
2004
Springer
We study polynomials of degree up to 4 over the rationals or a computable real subfield. Our motivation comes from the need to evaluate predicates in nonlinear computational geome...