Sciweavers

3267 search results - page 627 / 654
» Generalized quasirandom graphs
Sort
View
IWDC
2005
Springer
138views Communications» more  IWDC 2005»
14 years 1 months ago
Hierarchical Routing in Sensor Networks Using k-Dominating Sets
For a connected graph, representing a sensor network, distributed algorithms for the Set Covering Problem can be employed to construct reasonably small subsets of the nodes, calle...
Michael Q. Rieck, Subhankar Dhar
LCTRTS
2005
Springer
14 years 1 months ago
Cache aware optimization of stream programs
Effective use of the memory hierarchy is critical for achieving high performance on embedded systems. We focus on the class of streaming applications, which is increasingly preval...
Janis Sermulins, William Thies, Rodric M. Rabbah, ...
SG
2005
Springer
14 years 1 months ago
Knowledge in the Loop: Semantics Representation for Multimodal Simulative Environments
This article describes the integration of knowledge based techniques into simulative Virtual Reality (VR) applications. The approach is motivated ltimodal Virtual Construction as a...
Marc Erich Latoschik, Peter Biermann, Ipke Wachsmu...
WG
2005
Springer
14 years 1 months ago
Hypertree Decompositions: Structure, Algorithms, and Applications
We review the concepts of hypertree decomposition and hypertree width from a graph theoretical perspective and report on a number of recent results related to these concepts. We al...
Georg Gottlob, Martin Grohe, Nysret Musliu, Marko ...
IMC
2004
ACM
14 years 1 months ago
A pragmatic approach to dealing with high-variability in network measurements
The Internet is teeming with high variability phenomena, from measured IP flow sizes to aspects of inferred router-level connectivity, but there still exists considerable debate ...
Walter Willinger, David Alderson, Lun Li