Sciweavers

406 search results - page 18 / 82
» The Computation and Application of the Generalized Inverse v...
Sort
View
ICPR
2008
IEEE
14 years 2 months ago
Medical image segmentation via min s-t cuts with sides constraints
Graph cut algorithms (i.e., min s-t cuts) [3][10][15] are useful in many computer vision applications. In this paper we develop a formulation that allows the addition of side cons...
Jiun-Hung Chen, Linda G. Shapiro
CVPR
2012
IEEE
11 years 10 months ago
Mode-seeking on graphs via random walks
Mode-seeking has been widely used as a powerful data analysis technique for clustering and filtering in a metric feature space. We introduce a versatile and efficient modeseekin...
Minsu Cho, Kyoung Mu Lee
AAAI
2006
13 years 9 months ago
Efficient Active Fusion for Decision-Making via VOI Approximation
Active fusion is a process that purposively selects the most informative information from multiple sources as well as combines these information for achieving a reliable result ef...
Wenhui Liao, Qiang Ji
INFOCOM
2011
IEEE
12 years 11 months ago
Secure and practical outsourcing of linear programming in cloud computing
—Cloud Computing has great potential of providing robust computational power to the society at reduced cost. It enables customers with limited computational resources to outsourc...
Cong Wang, Kui Ren, Jia Wang
JGO
2010
100views more  JGO 2010»
13 years 2 months ago
On convex relaxations of quadrilinear terms
The best known method to find exact or at least -approximate solutions to polynomial programming problems is the spatial Branch-and-Bound algorithm, which rests on computing lower...
Sonia Cafieri, Jon Lee, Leo Liberti