Sciweavers

2917 search results - page 427 / 584
» Satisfying Interaction Constraints
Sort
View
GIS
2006
ACM
15 years 4 months ago
Dynamic simplification and visualization of large maps
In this paper, we present an algorithm that performs simplification of large geographical maps through a novel use of graphics hardware. Given a map as a collection of non-interse...
Nabil H. Mustafa, Shankar Krishnan, Gokul Varadhan...
JALC
2006
125views more  JALC 2006»
15 years 4 months ago
A Confinement Criterion for Securely Executing Mobile Code
Mobile programs, like applets, are not only ubiquitous, but also potentially malicious. We study the case where mobile programs are executed by a host system in a secured environm...
Hervé Grall
JODS
2008
123views Data Mining» more  JODS 2008»
15 years 4 months ago
A Fine-Grained Approach to Resolving Unsatisfiable Ontologies
The ability to deal with inconsistencies and to evaluate the impact of possible solutions for resolving inconsistencies are of the utmost importance in real world ontology applicat...
Joey Sik Chun Lam, Derek H. Sleeman, Jeff Z. Pan, ...
JUCS
2008
145views more  JUCS 2008»
15 years 4 months ago
Development of Ambient Intelligence Systems Based on Collaborative Task Models
: So far, the Ambient Intelligence (AmI) paradigm has been applied to the development of a great variety of real systems. They use advanced technologies such as ubiquitous computin...
Roberto F. Arroyo, Miguel Gea, José Luis Ga...
IJAR
2007
130views more  IJAR 2007»
15 years 4 months ago
Bayesian network learning algorithms using structural restrictions
The use of several types of structural restrictions within algorithms for learning Bayesian networks is considered. These restrictions may codify expert knowledge in a given domai...
Luis M. de Campos, Javier Gomez Castellano