148 search results - page 14 / 30 » Formally Analyzing Expected Time Complexity of Algorithms Us... |
WWW
2010
ACM
14 years 2 months ago
2010
ACM
We present a tool for helping XML schema designers to obtain a high quality level for their specifications. The tool allows one to analyze relations between classes of XML docume...
PODS
2008
ACM
14 years 7 months ago
2008
ACM
We present a novel definition of privacy in the framework of offline (retroactive) database query auditing. Given information about the database, a description of sensitive data, ...
SPAA
1993
ACM
13 years 11 months ago
1993
ACM
We give tight bounds on the parallel complexity of some problems involving random graphs. Speci cally, we show that a Hamiltonian cycle, a breadth rst spanning tree, and a maximal...
JSAC
2008
13 years 7 months ago
2008
In this paper, we investigate the coverage problem in wireless sensor networks using a game theory method. We assume that nodes are randomly scattered in a sensor field and the goa...
BMCBI
2010
13 years 7 months ago
2010
Background: A growing demand for tools to assist the building and analysis of biological networks exists in systems biology. We argue that the use of a formal approach is relevant...