Sciweavers

1857 search results - page 191 / 372
» Minimum Degree Orderings
Sort
View
COMCOM
2007
119views more  COMCOM 2007»
15 years 6 months ago
A new high rate adaptive wireless data dissemination scheme
With the increasing popularity of wireless networks and mobile computing, data broadcasting has emerged as an efficient way of delivering data to mobile clients having a high degr...
Petros Nicopolitidis, Georgios I. Papadimitriou, M...
COMGEO
2007
ACM
15 years 6 months ago
An intersection-sensitive algorithm for snap rounding
Snap rounding is a method for converting arbitrary-precision arrangements of segments into fixed-precision representation. We present an algorithm for snap rounding with running ...
Mark de Berg, Dan Halperin, Mark H. Overmars
JGT
2008
103views more  JGT 2008»
15 years 6 months ago
Game coloring the Cartesian product of graphs
: This article proves the following result: Let G and G be graphs of orders n and n , respectively. Let G be obtained from G by adding to each vertex a set of n degree 1 neighbors....
Xuding Zhu
DSS
2007
98views more  DSS 2007»
15 years 6 months ago
Modelling uncertain positive and negative reasons in decision aiding
The use of positive and negative reasons in inference and decision aiding is a recurrent issue of investigation as far as the type of formal language to use within a DSS is concer...
Meltem Öztürk, Alexis Tsoukiàs
SOCO
2008
Springer
15 years 6 months ago
Controlling the Performance Overhead of Component-Based Systems
Flexibility can significantly impact performance. Some component-based frameworks come with a near to zero overhead but provide only build-time configurability. Other solutions pro...
Olivier Lobry, Juraj Polakovic