Sciweavers

1998 search results - page 176 / 400
» Complexity of the Cover Polynomial
Sort
View
EUROGRAPHICS
2010
Eurographics
16 years 1 months ago
Interactive High-Quality Visualization of Higher-Order Finite Elements
Higher-order finite element methods have emerged as an important discretization scheme for simulation. They are increasingly used in contemporary numerical solvers, generating a ...
Markus Üffinger, Steffen Frey, Thomas Ertl
ITSL
2008
15 years 8 months ago
A Randomized Complexity-theoretic Model of Bio-inspired Mobile Epidemics via Close Contact
In this paper we present a randomized complexity theoretic model for those epidemics propagated via short-distance close contact. We prove that the contact-based epidemics problems...
Zhen Cao, Jiejun Kong, Mario Gerla, Dapeng Wu
ICCSA
2009
Springer
16 years 1 months ago
MDA-Based Framework for Automatic Generation of Consistent Firewall ACLs with NAT
Abstract. The design and management of firewall ACLs is a very hard and error-prone task. Part of this complexity comes from the fact that each firewall platform has its own low-le...
Sergio Pozo, A. J. Varela-Vaca, Rafael M. Gasca
INFOCOM
2007
IEEE
16 years 25 days ago
Randomized k-Coverage Algorithms For Dense Sensor Networks
— We propose new algorithms to achieve k-coverage in dense sensor networks. In such networks, covering sensor locations approximates covering the whole area. However, it has been...
Mohamed Hefeeda, M. Bagheri
APN
2007
Springer
16 years 21 days ago
Nets with Tokens Which Carry Data
Abstract. We study data nets, a generalisation of Petri nets in which tokens carry data from linearlyordered infinite domains and in which whole-place operations such as resets an...
Ranko Lazic, Thomas Christopher Newcomb, Joël...