4137 search results - page 796 / 828 » On the number of matchings of a tree |
EAGC
2003
Springer
14 years 28 days ago
2003
Springer
The complexity of Grid environments is growing as more projects and applications appear in this quick-evolving domain. Widespread applications are distributed over thousands of com...
ISAAC
2003
Springer
14 years 27 days ago
2003
Springer
Abstract. Fast algorithms for arithmetic on real or complex polynomials are wellknown and have proven to be not only asymptotically efficient but also very practical. Based on Fas...
COMPGEOM
2010
ACM
14 years 23 days ago
2010
ACM
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
FOCS
2002
IEEE
14 years 20 days ago
2002
IEEE
A standard load balancing model considers placing Ò balls into Ò bins by choosing possible locations for each ball independently and uniformly at random and sequentially placing...
ICRA
2002
IEEE
14 years 19 days ago
2002
IEEE
—This article describes a rigorous and complete framework for the simultaneous localization and map building problem for mobile robots: the symmetries and perturbations map (SPma...