Sciweavers

8838 search results - page 202 / 1768
» Generalizing Domain Theory
Sort
View
SIAMDM
2010
101views more  SIAMDM 2010»
15 years 3 months ago
Combinatorics and Genus of Tropical Intersections and Ehrhart Theory
Let g1, . . . , gk be tropical polynomials in n variables with Newton polytopes P1, . . . , Pk. We study combinatorial questions on the intersection of the tropical hypersurfaces d...
Reinhard Steffens, Thorsten Theobald
ECSQARU
2009
Springer
15 years 2 months ago
Can the Minimum Rule of Possibility Theory Be Extended to Belief Functions?
Abstract. When merging belief functions, Dempster rule of combination is justified only when sources can be considered as independent. When dependencies are ill-known, it is usual ...
Sébastien Destercke, Didier Dubois
CORR
2011
Springer
169views Education» more  CORR 2011»
14 years 11 months ago
Linear-Time Algorithms for Graphs of Bounded Rankwidth: A Fresh Look Using Game Theory
d Abstract) Alexander Langer, Peter Rossmanith, and Somnath Sikdar RWTH Aachen University, 52074 Aachen, Germany. We present an alternative proof of a theorem by Courcelle, Makowsk...
Alexander Langer, Peter Rossmanith, Somnath Sikdar
TSP
2010
14 years 11 months ago
Algebraic signal processing theory: sampling for infinite and finite 1-D space
We derive a signal processing framework, called space signal processing, that parallels time signal processing. As such, it comes in four versions (continuous/discrete, infinite/fi...
Jelena Kovacevic, Markus Püschel
KBS
2006
59views more  KBS 2006»
15 years 4 months ago
Representing dialogic argumentation
Dialogic argumentation is a crucial component in many computational domains, and forms a core component of argumentation theory. This paper compares two approaches to dialogue tha...
Chris Reed