Sciweavers

1064 search results - page 158 / 213
» Exact Algorithms for the Quadratic Linear Ordering Problem
Sort
View
KDD
2007
ACM
227views Data Mining» more  KDD 2007»
16 years 4 months ago
Fast best-effort pattern matching in large attributed graphs
We focus on large graphs where nodes have attributes, such as a social network where the nodes are labelled with each person's job title. In such a setting, we want to find s...
Hanghang Tong, Christos Faloutsos, Brian Gallagher...
ICDCS
2008
IEEE
15 years 10 months ago
Correlation-Aware Object Placement for Multi-Object Operations
A multi-object operation incurs communication or synchronization overhead when the requested objects are distributed over different nodes. The object pair correlations (the probab...
Ming Zhong, Kai Shen, Joel I. Seiferas
CIVR
2009
Springer
212views Image Analysis» more  CIVR 2009»
15 years 10 months ago
Video copy detection by fast sequence matching
Sequence matching techniques are effective for comparing two videos. However, existing approaches suffer from demanding computational costs and thus are not scalable for large-sca...
Mei-Chen Yeh, Kwang-Ting Cheng
ICPR
2008
IEEE
15 years 10 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
DATAMINE
2006
127views more  DATAMINE 2006»
15 years 4 months ago
Computing LTS Regression for Large Data Sets
Least trimmed squares (LTS) regression is based on the subset of h cases (out of n) whose least squares t possesses the smallest sum of squared residuals. The coverage h may be se...
Peter Rousseeuw, Katrien van Driessen