Sciweavers

4047 search results - page 189 / 810
» The Discrete Basis Problem
Sort
View
UAI
2004
15 years 4 months ago
Hybrid Influence Diagrams Using Mixtures of Truncated Exponentials
Mixtures of truncated exponentials (MTE) potentials are an alternative to discretization for representing continuous chance variables in influence diagrams. Also, MTE potentials c...
Barry R. Cobb, Prakash P. Shenoy
EOR
2008
97views more  EOR 2008»
15 years 3 months ago
Decision making with hybrid influence diagrams using mixtures of truncated exponentials
Mixtures of truncated exponentials (MTE) potentials are an alternative to discretization for representing continuous chance variables in influence diagrams. Also, MTE potentials c...
Barry R. Cobb, Prakash P. Shenoy
INFORMATICALT
2008
104views more  INFORMATICALT 2008»
15 years 3 months ago
An Efficient Technique to Detect Visual Defects in Particleboards
This paper is concerned with the problem of image analysis based detection of local defects embedded in particleboard surfaces. Though simple, but efficient technique developed is ...
Jonas Guzaitis, Antanas Verikas
IJNSEC
2006
107views more  IJNSEC 2006»
15 years 3 months ago
ID-based Signcryption Scheme with (t, n) Shared Unsigncryption
An identity-based signcryption scheme with (t, n) shared unsigncryption is proposed, which is the integration of the signcryption scheme, the (t, n) threshold scheme and zero know...
Fagen Li, Xiangjun Xin, Yupu Hu
151
Voted
COMPGEOM
2010
ACM
15 years 8 months ago
Adding one edge to planar graphs makes crossing number hard
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show that it is NP-hard to compute the crossing number of near-planar graphs. The main idea ...
Sergio Cabello, Bojan Mohar