4047 search results - page 525 / 810 » The Discrete Basis Problem |
153
Voted
EMMCVPR
2001
Springer
15 years 9 months ago
2001
Springer
Recent work (Yedidia, Freeman, Weiss [22]) has shown that stable points of belief propagation (BP) algorithms [12] for graphs with loops correspond to extrema of the Bethe free ene...
144
Voted
ASIACRYPT
2000
Springer
15 years 9 months ago
2000
Springer
Abstract. Construction of secure hyperelliptic curves is of most important yet most difficult problem in design of cryptosystems based on the discrete logarithm problems on hyperel...
153
click to vote
GMP
2010
IEEE
15 years 9 months ago
2010
IEEE
Abstract. In isogeometric analysis (IGA for short) framework, computational domain is exactly described using the same representation as that employed in the CAD process. For a CAD...
139
Voted
STACS
1997
Springer
15 years 9 months ago
1997
Springer
Exotic semirings such as the “(max, +) semiring” (R ∪ {−∞}, max, +), or the “tropical semiring” (N ∪ {+∞}, min, +), have been invented and reinvented many times s...
139
click to vote
CIDM
2009
IEEE
15 years 8 months ago
2009
IEEE
Most real-world classification problems involve continuous (real-valued) attributes, as well as, nominal (discrete) attributes. The majority of Ant Colony Optimisation (ACO) classi...