Sciweavers

549 search results - page 93 / 110
» On the Complexity of Restricted k-anonymity Problem
Sort
View
GEOINFORMATICA
2006
135views more  GEOINFORMATICA 2006»
14 years 9 months ago
Metadata Community Profiles for the Semantic Web
Metadata is needed to facilitate data sharing among geospatial information communities. Geographic Metadata Standards are available but tend to be general and complex in nature an...
Luis Bermudez, Michael Piasecki
JAIR
2006
110views more  JAIR 2006»
14 years 9 months ago
Modelling Mixed Discrete-Continuous Domains for Planning
In this paper we present pddl+, a planning domain description language for modelling mixed discrete-continuous planning domains. We describe the syntax and modelling style of pddl...
Maria Fox, Derek Long
LOGCOM
2007
115views more  LOGCOM 2007»
14 years 9 months ago
The Dynamics of Syntactic Knowledge
The syntactic approach to epistemic logic avoids the logical omniscience problem by taking knowledge as primary rather than as defined in terms of possible worlds. In this study, ...
Thomas Ågotnes, Natasha Alechina
ENTCS
2007
145views more  ENTCS 2007»
14 years 9 months ago
Design, Analysis and Performance Evaluation of Group Key Establishment in Wireless Sensor Networks
Wireless sensor networks are comprised of a vast number of ultra-small autonomous computing, communication and sensing devices, with restricted energy and computing capabilities, ...
Ioannis Chatzigiannakis, Elisavet Konstantinou, Va...
JACM
2000
119views more  JACM 2000»
14 years 9 months ago
A subdivision-based algorithm for the sparse resultant
Multivariate resultants generalize the Sylvester resultant of two polynomials and characterize the solvability of a polynomial system. They also reduce the computation of all comm...
John F. Canny, Ioannis Z. Emiris