Sciweavers

1162 search results - page 79 / 233
» Minimum Cycle Bases in Graphs Algorithms and Applications
Sort
View
IBIS
2006
109views more  IBIS 2006»
13 years 8 months ago
Formulation Schema Matching Problem for Combinatorial Optimization Problem
: Schema matching is the task of finding semantic correspondences between elements of two schemas, which plays a key role in many database applications. In this paper, we cast the ...
Zhi Zhang, Pengfei Shi, Haoyang Che, Yong Sun, Jun...
KDD
2006
ACM
122views Data Mining» more  KDD 2006»
14 years 8 months ago
Measuring and extracting proximity in networks
Measuring distance or some other form of proximity between objects is a standard data mining tool. Connection subgraphs were recently proposed as a way to demonstrate proximity be...
Yehuda Koren, Stephen C. North, Chris Volinsky
FOCS
2008
IEEE
14 years 2 months ago
Algorithms for Single-Source Vertex Connectivity
In the Survivable Network Design Problem (SNDP) the goal is to find a minimum cost subset of edges that satisfies a given set of pairwise connectivity requirements among the ver...
Julia Chuzhoy, Sanjeev Khanna
EMMCVPR
1999
Springer
14 years 17 days ago
A New Algorithm for Energy Minimization with Discontinuities
Many tasks in computer vision involve assigning a label (such as disparity) to every pixel. These tasks can be formulated as energy minimization problems. In this paper, we conside...
Yuri Boykov, Olga Veksler, Ramin Zabih
IJON
2011
186views more  IJON 2011»
12 years 11 months ago
Discriminative structure selection method of Gaussian Mixture Models with its application to handwritten digit recognition
, Yunde Jia Model structure selection is currently an open problem in modeling data via Gaussian Mixture Models (GMM). This paper proposes a discriminative method to select GMM st...
Xuefeng Chen, Xiabi Liu, Yunde Jia