Sciweavers

2523 search results - page 99 / 505
» Objective: In Minimum Context
Sort
View
CIKM
1994
Springer
15 years 10 months ago
Semantics-Based Information Brokering
The rapid advances in computer and communication technologies, and their merger, is leading to a global information market place. It will consist of federations of very large numb...
Vipul Kashyap, Amit P. Sheth
CAISE
2009
Springer
16 years 29 days ago
A Goal Modeling Framework for Self-contextualizable Software
Self-contextualizability refers to the system ability to autonomously adapt its behaviour to context in order to maintain its objectives satisfied. In this paper, we propose a mod...
Raian Ali, Fabiano Dalpiaz, Paolo Giorgini
LREC
2010
202views Education» more  LREC 2010»
15 years 7 months ago
Can Syntactic and Logical Graphs help Word Sense Disambiguation?
This paper presents a word sense disambiguation (WSD) approach based on syntactic and logical representations. The objective here is to run a number of experiments to compare stan...
Amal Zouaq, Michel Gagnon, Benoît Ozell
ISVC
2009
Springer
15 years 11 months ago
Deformable Proximity Queries and Their Application in Mobile Manipulation Planning
Abstract. We describe a proximity query algorithm for the exact minimum distance computation between arbitrarily shaped objects. Special characteristics of the Gilbert-Johnson-Keer...
Marc Gissler, Christian Dornhege, Bernhard Nebel, ...
ENDM
2006
127views more  ENDM 2006»
15 years 6 months ago
Greedy defining sets in graphs and Latin squares
Greedy algorithm sometimes uses more than (G) colors while coloring a graph G. A greedy defining set is an object to eliminate these extra colors so that the greedy coloring resul...
Manouchehr Zaker