Sciweavers

5889 search results - page 1098 / 1178
» Graph Layout Problems
Sort
View
CVIU
2008
180views more  CVIU 2008»
15 years 2 months ago
Topology cuts: A novel min-cut/max-flow algorithm for topology preserving segmentation in N-D images
Topology is an important prior in many image segmentation tasks. In this paper, we design and implement a novel graph-based min-cut/max-flow algorithm that incorporates topology p...
Yun Zeng, Dimitris Samaras, Wei Chen, Qunsheng Pen...
115
Voted
ECRA
2010
145views more  ECRA 2010»
15 years 2 months ago
Inferring preference correlations from social networks
Identifying consumer preferences is a key challenge in customizing electronic commerce sites to individual users. The increasing availability of online social networks provides on...
Tad Hogg
ACTA
2006
104views more  ACTA 2006»
15 years 2 months ago
Safe projections of binary data sets
Abstract Selectivity estimation of a boolean query based on frequent itemsets can be solved by describing the problem by a linear program. However, the number of variables in the e...
Nikolaj Tatti
101
Voted
IJHPCA
2006
125views more  IJHPCA 2006»
15 years 2 months ago
Complexity Results for Collective Communications on Heterogeneous Platforms
In this paper, we consider the communications involved in the execution of a complex application, deployed on a heterogeneous platform. Such applications extensively use macro-com...
Olivier Beaumont, Loris Marchal, Yves Robert
CORR
2007
Springer
146views Education» more  CORR 2007»
15 years 2 months ago
Coding for Errors and Erasures in Random Network Coding
Abstract—The problem of error-control in random linear network coding is considered. A “noncoherent” or “channel oblivious” model is assumed where neither transmitter nor...
Ralf Koetter, Frank R. Kschischang
« Prev « First page 1098 / 1178 Last » Next »