Sciweavers

2487 search results - page 469 / 498
» Partitions of Graphs into Trees
Sort
View
NRHM
2008
106views more  NRHM 2008»
13 years 8 months ago
Towards the unification of formats for overlapping markup
Overlapping markup refers to the issue of how to represent data structures more expressive than trees--for example direct acyclic graphs--using markup (meta-)languages which have ...
Paolo Marinelli, Fabio Vitali, Stefano Zacchiroli
ADHOC
2005
102views more  ADHOC 2005»
13 years 8 months ago
Localized LMST and RNG based minimum-energy broadcast protocols in ad hoc networks
In the minimum energy broadcasting problem, each node adjusts its transmission power to minimize the total energy consumption while still guaranteeing the full coverage of the net...
Julien Cartigny, François Ingelrest, David ...
CN
2004
114views more  CN 2004»
13 years 7 months ago
Representing the Internet as a succinct forest
Effective placement of resources used to support distributed services in the Internet depends on an accurate representation of Internet topology and routing. Representations of au...
Jim Gast, Paul Barford
IJFCS
1998
67views more  IJFCS 1998»
13 years 7 months ago
Vertex Splitting in Dags and Applications to Partial Scan Designs and Lossy Circuits
Directed acyclic graphs (dags) are often used to model circuits. Path lengths in such dags represent circuit delays. In the vertex splitting problem, the objective is to determine...
Doowon Paik, Sudhakar M. Reddy, Sartaj Sahni
KI
2002
Springer
13 years 7 months ago
Representation of Behavioral Knowledge for Planning and Plan-Recognition in a Cognitive Vision System
The algorithmic generation of textual descriptions of image sequences requires conceptual knowledge. In our case, a stationary camera recorded image sequences of road traffic scene...
Michael Arens, Hans-Hellmut Nagel