Sciweavers

3991 search results - page 783 / 799
» Bounding homogeneous models
Sort
View
DIALM
2008
ACM
179views Algorithms» more  DIALM 2008»
13 years 9 months ago
Distance graphs: from random geometric graphs to Bernoulli graphs and between
A random geometric graph G(n, r) is a graph resulting from placing n points uniformly at random on the unit area disk, and connecting two points iff their Euclidean distance is at ...
Chen Avin
EKAW
2008
Springer
13 years 9 months ago
Learning Disjointness for Debugging Mappings between Lightweight Ontologies
Abstract. Dealing with heterogeneous ontologies by means of semantic mappings has become an important area of research and a number of systems for discovering mappings between onto...
Christian Meilicke, Johanna Völker, Heiner St...
SIROCCO
2004
13 years 9 months ago
Asynchronous Broadcast in Radio Networks
Abstract. We study asynchronous packet radio networks in which transmissions among nodes may be delayed. We consider the task of broadcasting a message generated by the source node...
Bogdan S. Chlebus, Mariusz A. Rokicki
NIPS
2003
13 years 9 months ago
Max-Margin Markov Networks
In typical classification tasks, we seek a function which assigns a label to a single object. Kernel-based approaches, such as support vector machines (SVMs), which maximize the ...
Benjamin Taskar, Carlos Guestrin, Daphne Koller
AAAI
2008
13 years 9 months ago
Querying Sequential and Concurrent Horn Transaction Logic Programs Using Tabling Techniques
In this poster we describe the tabling techniques for Sequential and Concurrent Horn Transaction Logic. Horn Transaction Logic is an extension of classical logic programming with ...
Paul Fodor