202 search results - page 33 / 41 » Large-Girth Roots of Graphs |
ISSAC
2007
Springer
14 years 1 months ago
2007
Springer
An algorithm is presented for the geometric analysis of an algebraic curve f(x, y) = 0 in the real affine plane. It computes a cylindrical algebraic decomposition (CAD) of the pla...
IPPS
2003
IEEE
14 years 19 days ago
2003
IEEE
— We consider the problem of maintaining routing paths between nodes in a dynamic network. Gafni and Bertsekas proposed a link reversal approach called the BG method that maintai...
SIGMOD
2010
ACM
14 years 5 days ago
2010
ACM
In this paper, we propose an online aggregation system called COSMOS (Continuous Sampling for Multiple queries in an Online aggregation System), to process multiple aggregate quer...
STACS
2001
Springer
13 years 11 months ago
2001
Springer
We consider the problem of computing an optimal range assignment in a wireless network which allows a specified source station to perform a broadcast operation. In particular, we ...
ADHOCNOW
2008
Springer
13 years 8 months ago
2008
Springer
We study the problem of gathering information from the nodes of a multi-hop radio network into a pre-defined destination node under the interference constraints. In such a network...