725 search results - page 75 / 145 » Bounding Degrees on RPL |
APAL
2005
15 years 18 days ago
2005
Abstract. We prove that a finitely generated group is context-free whenever its Cayleygraph has a decidable monadic second-order theory. Hence, by the seminal work of Muller and Sc...
98
Voted
INFOCOM
2007
IEEE
15 years 7 months ago
2007
IEEE
Abstract— Data aggregation is a fundamental yet timeconsuming task in wireless sensor networks. We focus on the latency part of data aggregation. Previously, the data aggregation...
83
Voted
ALT
1998
Springer
15 years 5 months ago
1998
Springer
Concept drift means that the concept about which data is obtained may shift from time to time, each time after some minimum permanence. Except for this minimum permanence, the con...
102
Voted
GD
1997
Springer
15 years 4 months ago
1997
Springer
This paper studies 3-D orthogonal grid drawings for graphs of arbitrary degree, in particular Kn, with vertices drawn as boxes. It establishes asymptotic lower bounds for the volu...
DAGSTUHL
2008
15 years 2 months ago
2008
Abstract. We present algorithmic, complexity and implementation results concerning real root isolation of a polynomial of degree d, with integer coefficients of bit size , using S...