Sciweavers

982 search results - page 164 / 197
» Solving Steiner tree problems in graphs to optimality
Sort
View
JMLR
2010
149views more  JMLR 2010»
13 years 3 months ago
Learning Bayesian Network Structure using LP Relaxations
We propose to solve the combinatorial problem of finding the highest scoring Bayesian network structure from data. This structure learning problem can be viewed as an inference pr...
Tommi Jaakkola, David Sontag, Amir Globerson, Mari...
WCNC
2008
IEEE
14 years 3 months ago
Cooperative Transmission in a Wireless Cluster Based on Flow Management
—In this paper, a cooperative transmission design for a multi-node wireless cluster network is presented. It is assumed that the nodes operate in half-duplex mode and that channe...
Debdeep Chatterjee, Tan F. Wong, Tat M. Lok
LION
2007
Springer
138views Optimization» more  LION 2007»
14 years 3 months ago
A Continuous Characterization of Maximal Cliques in k-Uniform Hypergraphs
Abstract. In 1965 Motzkin and Straus established a remarkable connection between the local/global maximizers of the Lagrangian of a graph G over the standard simplex ∆ and the ma...
Samuel Rota Bulò, Marcello Pelillo
CVPR
2004
IEEE
14 years 11 months ago
Tracking Loose-Limbed People
We pose the problem of 3D human tracking as one of inference in a graphical model. Unlike traditional kinematic tree representations, our model of the body is a collection of loos...
Leonid Sigal, Sidharth Bhatia, Stefan Roth, Michae...
ICIP
1999
IEEE
14 years 10 months ago
Quadtrees for Embedded Surface Visualization: Constraints and Efficient Data Structures
The quadtree data structure is widely used in digital image processing and computer graphics for modeling spatial segmentation of images and surfaces. A quadtree is a tree in whic...
Laurent Balmelli, Jelena Kovacevic, Martin Vetterl...