973 search results - page 137 / 195 » New Bounds on Crossing Numbers |
235
click to vote
FOSAD
2009
Springer
16 years 22 days ago
2009
Springer
We introduce the Open-source Fixed-point Model Checker OFMC for symbolic security protocol analysis, which extends the Onthe-fly Model Checker (the previous OFMC). The native inpu...
186
click to vote
ICDCS
2008
IEEE
16 years 18 days ago
2008
IEEE
— Connected dominating set (CDS) has a wide range of applications in wireless ad hoc networks. A number of distributed algorithms for constructing a small CDS in wireless ad hoc ...
159
click to vote
COMPGEOM
2004
ACM
15 years 11 months ago
2004
ACM
We present a new algorithm for unfolding planar polygonal linkages without self-intersection based on following the gradient flow of a “repulsive” energy function. This algor...
174
click to vote
LCTRTS
1998
Springer
15 years 10 months ago
1998
Springer
Abstract. Previously published methods for estimation of the worstcase execution time on contemporary processors with complex pipelines and multi-level memory hierarchies result in...
178
click to vote
COCOON
2008
Springer
15 years 8 months ago
2008
Springer
In this paper, we consider a new visual cryptography scheme that allows for sharing of multiple secret images on graphs: we are given an arbitrary graph (V, E) where every node an...