Sciweavers

1089 search results - page 89 / 218
» Bounds on generalized Frobenius numbers
Sort
View
SPAA
2009
ACM
14 years 6 months ago
At-most-once semantics in asynchronous shared memory
Abstract. At-most-once semantics is one of the standard models for object access in decentralized systems. Accessing an object, such as altering the state of the object by means of...
Sotiris Kentros, Aggelos Kiayias, Nicolas C. Nicol...
ICNP
2009
IEEE
14 years 3 months ago
oCast: Optimal Multicast Routing Protocol for Wireless Sensor Networks
—In this paper, we describe oCast, an energy-optimal multicast routing protocol for wireless sensor networks. The general minimum-energy multicast problem is NP-hard. Intermitten...
Lu Su, Bolin Ding, Yong Yang, Tarek F. Abdelzaher,...
COCOON
2009
Springer
14 years 3 months ago
On the Readability of Monotone Boolean Formulae
Golumbic et al. [Discrete Applied Mathematics 154(2006) 1465-1477] defined the readability of a monotone Boolean function f to be the minimum integer k such that there exists an ...
Khaled M. Elbassioni, Kazuhisa Makino, Imran Rauf
JGTOOLS
2008
126views more  JGTOOLS 2008»
13 years 9 months ago
Simple Empty-Space Removal for Interactive Volume Rendering
Interactive volume rendering methods such as texture-based slicing techniques and ray-casting have been well developed in recent years. The rendering performance is generally restr...
Vincent Vidal 0002, Xing Mei, Philippe Decaudin
ENDM
2007
140views more  ENDM 2007»
13 years 9 months ago
Acyclic dominating partitions
Given a graph G = (V, E), let P be a partition of V . We say that P is dominating if, for each part P of P, the set V \ P is a dominating set in G (equivalently, if every vertex h...
Louigi Addario-Berry, Ross J. Kang