Sciweavers

3708 search results - page 83 / 742
» Approximating Betweenness Centrality
Sort
View
KR
2004
Springer
15 years 6 months ago
Approximative Query Techniques for Agents with Heterogeneous Ontologies and Perceptive Capabilities
In this paper, we propose a framework that provides software and robotic agents with the ability to ask approximate questions to each other in the context of heterogeneous ontolog...
Patrick Doherty, Andrzej Szalas, Witold Lukaszewic...
112
Voted
AAAI
2007
15 years 2 months ago
Partial Matchmaking using Approximate Subsumption
Description Logics, and in particular the web ontology language OWL has been proposed as an appropriate basis for computing matches between structured objects for the sake of info...
Heiner Stuckenschmidt
COLOGNETWENTE
2008
15 years 2 months ago
A Simple 3-Approximation of Minimum Manhattan Networks
Given a set P of n points in the plane, a Manhattan network of P is a network that contains a rectilinear shortest path between every pair of points of P. A minimum Manhattan netw...
Bernhard Fuchs, Anna Schulze
CAD
2008
Springer
15 years 21 days ago
Approximate computation of curves on B-spline surfaces
Curves on surfaces play an important role in computer-aided geometric design. Because of the considerably high degree of exact curves on surfaces, approximation algorithms are pre...
Yi-Jun Yang, Song Cao, Jun-Hai Yong, Hui Zhang, Je...
90
Voted
ICML
2005
IEEE
16 years 1 months ago
Compact approximations to Bayesian predictive distributions
We provide a general framework for learning precise, compact, and fast representations of the Bayesian predictive distribution for a model. This framework is based on minimizing t...
Edward Snelson, Zoubin Ghahramani