Sciweavers

1688 search results - page 126 / 338
» The Complexity of Rationalizing Matchings
Sort
View
ML
2000
ACM
103views Machine Learning» more  ML 2000»
15 years 5 months ago
Phase Transitions in Relational Learning
One of the major limitations of relational learning is due to the complexity of verifying hypotheses on examples. In this paper we investigate this task in light of recent publishe...
Attilio Giordana, Lorenza Saitta
EUMAS
2006
15 years 7 months ago
Agents Arguing over Ontology Alignments
ed Abstract Ontologies play an important role in inter-agent communication, by providing the definitions of the vocabularies used by agents to describe the world [4]. An agent can ...
Loredana Laera, Valentina A. M. Tamma, Jér&...
ALGORITHMICA
2010
154views more  ALGORITHMICA 2010»
15 years 6 months ago
On the Convergence of Multicast Games in Directed Networks
We investigate the convergence of the price of anarchy after a limited number of moves in the classical multicast communication game when the underlying communication networks is ...
Angelo Fanelli, Michele Flammini, Luca Moscardelli
CVPR
2001
IEEE
16 years 7 months ago
Semi-Dense Stereo Correspondence with Dense Features
We present a new feature based algorithm for stereo correspondence. Most of the previous feature based methods match sparse features like edge pixels, producing only sparse dispar...
Olga Veksler
IISWC
2008
IEEE
16 years 7 days ago
A workload for evaluating deep packet inspection architectures
—High-speed content inspection of network traffic is an important new application area for programmable networking systems, and has recently led to several proposals for high-per...
Michela Becchi, Mark A. Franklin, Patrick Crowley