Sciweavers

279 search results - page 37 / 56
» A Name Abstraction Functor for Named Sets
Sort
View
ECSQARU
2001
Springer
14 years 1 months ago
How to Reason Credulously and Skeptically within a Single Extension
Abstract. Consistency-based approaches in nonmonotonic reasoning may be expected to yield multiple sets of default conclusions for a given default theory. Reasoning about such exte...
James P. Delgrande, Torsten Schaub
ICN
2001
Springer
14 years 1 months ago
An Evaluation of Shared Multicast Trees with Multiple Active Cores
Abstract. Core-based multicast trees use less router state, but have significant drawbacks when compared to shortest-path trees, namely higher delay and poor fault tolerance. We e...
Daniel Zappala, Aaron Fabbri
ISAAC
2001
Springer
123views Algorithms» more  ISAAC 2001»
14 years 1 months ago
Labeling Subway Lines
Abstract. Graphical features on map, charts, diagrams and graph drawings usually must be annotated with text labels in order to convey their meaning. In this paper we focus on a pr...
Maria Angeles Garrido, Claudia Iturriaga, Alberto ...
ECAI
2000
Springer
14 years 1 months ago
Naive Bayes and Exemplar-based Approaches to Word Sense Disambiguation Revisited
Abstract. This paper describes an experimental comparison between two standard supervised learning methods, namely Naive Bayes and Exemplar–basedclassification, on the Word Sens...
Gerard Escudero, Lluís Màrquez, Germ...
APPROX
2007
Springer
86views Algorithms» more  APPROX 2007»
14 years 23 days ago
Lower Bounds for Swapping Arthur and Merlin
We prove a lower bound for swapping the order of Arthur and Merlin in two-round MerlinArthur games using black-box techniques. Namely, we show that any AM-game requires time (t2 )...
Scott Diehl