Sciweavers

2043 search results - page 213 / 409
» The Limits of Querying Ontologies
Sort
View
IAT
2010
IEEE
13 years 7 months ago
Selecting Operator Queries Using Expected Myopic Gain
When its human operator cannot continuously supervise (much less teleoperate) an agent, the agent should be able to recognize its limitations and ask for help when it risks making...
Robert Cohn, Michael Maxim, Edmund H. Durfee, Sati...
ICSNW
2004
Springer
188views Database» more  ICSNW 2004»
14 years 2 months ago
Peer Selection in Peer-to-Peer Networks with Semantic Topologies
Peer-to-Peer systems have proven to be an effective way of sharing data. Modern protocols are able to efficiently route a message to a given peer. However, determining the destin...
Peter Haase, Ronny Siebes, Frank van Harmelen
SEMWEB
2010
Springer
13 years 7 months ago
An Expressive and Efficient Solution to the Service Selection Problem
Given the large number of Semantic Web Services that can be created from online sources by using existing annotation tools, expressive formalisms and efficient and scalable approac...
Daniel Izquierdo, Maria-Esther Vidal, Blai Bonet
ICMCS
2005
IEEE
136views Multimedia» more  ICMCS 2005»
14 years 2 months ago
Efficient Hardware Search Engine for Associative Content Retrieval of Long Queries in Huge Multimedia Databases
Due to the enormous increase in the stored digital contents, search and retrieval functionalities are necessary in multimedia systems. Though processor speed for standard PCs (Per...
Christophe Layer, Hans-Jörg Pfleiderer
VISSYM
2004
13 years 10 months ago
Volume Visualization and Visual Queries for Large High-Dimensional Datasets
We propose a flexible approach for the visualization of large, high-dimensional datasets. The raw, highdimensional data is mapped into an abstract 3D distance space using the Fast...
Guido Reina, Thomas Ertl