Sciweavers

484 search results - page 88 / 97
» The number of convex permutominoes
Sort
View
101
Voted
ISCAS
1994
IEEE
131views Hardware» more  ISCAS 1994»
15 years 4 months ago
An Efficient Design Method for Optimal Weighted Median Filtering
Earlier research has shown that the problem of optimal weighted median filtering with structural constraints can be formulated as a nonconvex nonlinear programming problem in gene...
Ruikang Yang, Moncef Gabbouj, Yrjö Neuvo
98
Voted
IPMU
2010
Springer
15 years 4 months ago
Credal Sets Approximation by Lower Probabilities: Application to Credal Networks
Abstract. Credal sets are closed convex sets of probability mass functions. The lower probabilities specified by a credal set for each element of the power set can be used as cons...
Alessandro Antonucci, Fabio Cuzzolin
DCOSS
2007
Springer
15 years 4 months ago
Efficient Computation of Minimum Exposure Paths in a Sensor Network Field
The exposure of a path p is a measure of the likelihood that an object traveling along p is detected by a network of sensors and it is formally defined as an integral over all poin...
Hristo Djidjev
100
Voted
COCOON
2006
Springer
15 years 4 months ago
On Unfolding Lattice Polygons/Trees and Diameter-4 Trees
We consider the problems of straightening polygonal trees and convexifying polygons by continuous motions such that rigid edges can rotate around vertex joints and no edge crossing...
Sheung-Hung Poon
AAAI
2010
15 years 2 months ago
Multi-Label Learning with Weak Label
Multi-label learning deals with data associated with multiple labels simultaneously. Previous work on multi-label learning assumes that for each instance, the "full" lab...
Yu-Yin Sun, Yin Zhang, Zhi-Hua Zhou