Sciweavers

2214 search results - page 243 / 443
» Complexity of Reasoning
Sort
View
JCP
2008
133views more  JCP 2008»
15 years 3 months ago
DDSC : A Density Differentiated Spatial Clustering Technique
Finding clusters with widely differing sizes, shapes and densities in presence of noise and outliers is a challenging job. The DBSCAN is a versatile clustering algorithm that can f...
Bhogeswar Borah, Dhruba K. Bhattacharyya
CORR
2007
Springer
74views Education» more  CORR 2007»
15 years 3 months ago
Secure Two-party Protocols for Point Inclusion Problem
It is well known that, in theory, the general secure multiparty computation problem is solvable using circuit evaluation protocols. However, the communication complexity of the re...
Tony Thomas
JSA
2006
103views more  JSA 2006»
15 years 3 months ago
FMESP: Framework for the modeling and evaluation of software processes
Nowadays, organizations face with a very high competitiveness and for this reason they have to continuously improve their processes. Two key aspects to be considered in the softwa...
Félix García, Mario Piattini, Franci...
SYNTHESE
2008
114views more  SYNTHESE 2008»
15 years 3 months ago
Quantified coalition logic
We add a limited but useful form of quantification to Coalition Logic, a popular formalism for reasoning about cooperation in game-like multi-agent systems. The basic constructs o...
Thomas Ågotnes, Wiebe van der Hoek, Michael ...
TGIS
2008
69views more  TGIS 2008»
15 years 3 months ago
Spatial-Scene Similarity Queries
Assessing spatial scenes for similarity is difficult from a cognitive and computational perspective. Solutions to spatial-scene similarity assessments are sensible only if corresp...
Konstantinos A. Nedas, Max J. Egenhofer