1857 search results - page 33 / 372 » Minimum Degree Orderings |
FOSSACS
2004
Springer
14 years 4 months 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...
ICRA
2010
IEEE
13 years 9 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...
CORR
2010
Springer
13 years 10 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...
CORR
2010
Springer
13 years 10 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...
ESA
2004
Springer
14 years 4 months 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...