534 search results - page 27 / 107 » Efficient polynomial L-approximations |
112
click to vote
CPC
2006
15 years 1 months ago
2006
We show how to generate labeled and unlabeled outerplanar graphs with n vertices uniformly at random in polynomial time in n. To generate labeled outerplanar graphs, we present a c...
FOCS
1994
IEEE
15 years 6 months ago
1994
IEEE
We consrder asynchronous general topology dynamic networks of identical nameless nodes wzth worst-case transient faults. Starting from any faulty configuration, our protocols self...
JCAM
2010
14 years 8 months ago
2010
In this paper, (d + 1)-pencil lattices on simplicial partitions in Rd are studied. The barycentric approach naturally extends the lattice from a simplex to a simplicial partition,...
131
click to vote
AAECC
1997
Springer
15 years 6 months ago
1997
Springer
We describe the Maple [23] implementation of multivariate factorization over general finite fields. Our first implementation is available in Maple V Release 3. We give selected det...
IJCAI
1989
15 years 3 months ago
1989
We are interested here in the design of a very efficient Time-Map Manager, able to deal with a large knowledge-base of several thou sand time-tokens in demanding applications su...