Sciweavers

484 search results - page 50 / 97
» The number of convex permutominoes
Sort
View
SIAMDM
2008
119views more  SIAMDM 2008»
13 years 10 months ago
On the Graph Bisection Cut Polytope
Given a graph G = (V, E) with node weights v N {0}, v V , and some number F N{0}, the convex hull of the incidence vectors of all cuts (S), S V with (S) F and (V \ S) F is ...
Michael Armbruster, Christoph Helmberg, Marzena F&...
ICCV
2009
IEEE
15 years 3 months ago
Efficient Discriminative Learning of Parts-based Models
Supervised learning of a parts-based model can be for- mulated as an optimization problem with a large (exponen- tial in the number of parts) set of constraints. We show how thi...
M. Pawan Kumar, Andrew Zisserman, Philip H.S. Torr
APNOMS
2009
Springer
14 years 4 months ago
Bypassing Routing Holes in WSNs with a Predictive Geographic Greedy Forwarding
Applications in wireless sensor networks (WSNs) experience the routing hole problem. That is, the current node cannot forward to the destination, although it is the closest node, b...
Minh Thiep Ha, Priyadharshini Sakthivel, Hyunseung...
SUM
2009
Springer
14 years 4 months ago
Modeling Unreliable Observations in Bayesian Networks by Credal Networks
Bayesian networks are probabilistic graphical models widely employed in AI for the implementation of knowledge-based systems. Standard inference algorithms can update the beliefs a...
Alessandro Antonucci, Alberto Piatti
CISS
2008
IEEE
14 years 4 months ago
1-Bit compressive sensing
Abstract—Compressive sensing is a new signal acquisition technology with the potential to reduce the number of measurements required to acquire signals that are sparse or compres...
Petros Boufounos, Richard G. Baraniuk