Sciweavers

5158 search results - page 260 / 1032
» Generalization of the Dempster-Shafer Theory
Sort
View
COMPGEOM
2010
ACM
15 years 11 months ago
The complexity of the normal surface solution space
Normal surface theory is a central tool in algorithmic threedimensional topology, and the enumeration of vertex normal surfaces is the computational bottleneck in many important a...
Benjamin A. Burton
194
Voted
CORR
2007
Springer
133views Education» more  CORR 2007»
15 years 6 months ago
On Decidability Properties of Local Sentences
Local (first order) sentences, introduced by Ressayre, enjoy very nice decidability properties, following from some stretching theorems stating some remarkable links between the ...
Olivier Finkel
PAMI
2008
121views more  PAMI 2008»
15 years 6 months ago
Theoretical Foundations of Spatially-Variant Mathematical Morphology Part II: Gray-Level Images
In this paper, we develop a spatially-variant (SV) mathematical morphology theory for gray-level signals and images in the euclidean space. The proposed theory preserves the geomet...
Nidhal Bouaynaya, Dan Schonfeld
DAC
2005
ACM
16 years 7 months ago
Efficient SAT solving: beyond supercubes
SAT (Boolean satisfiability) has become the primary Boolean reasoning engine for many EDA applications, so the efficiency of SAT solving is of great practical importance. Recently...
Domagoj Babic, Jesse D. Bingham, Alan J. Hu
WWW
2008
ACM
16 years 7 months ago
Dynamic cost-per-action mechanisms and applications to online advertising
We study the Cost-Per-Action or Cost-Per-Acquisition (CPA) charging scheme in online advertising. In this scheme, instead of paying per click, the advertisers pay only when a user...
Hamid Nazerzadeh, Amin Saberi, Rakesh Vohra