Sciweavers

109 search results - page 3 / 22
» Watermarking Graph Partitioning Solutions
Sort
View
ACPC
1999
Springer
13 years 10 months ago
Non-standard Parallel Solution Strategies for Distributed Sparse Linear Systems
Abstract. A number of techniques are described for solving sparse linear systems on parallel platforms. The general approach used is a domaindecomposition type method in which a pr...
Yousef Saad, Masha Sosonkina
PAMI
2006
226views more  PAMI 2006»
13 years 5 months ago
Graph Partitioning Active Contours (GPAC) for Image Segmentation
In this paper we introduce new type of variational segmentation cost functions and associated active contour methods that are based on pairwise similarities or dissimilarities of t...
Baris Sumengen, B. S. Manjunath
ISSS
1997
IEEE
109views Hardware» more  ISSS 1997»
13 years 9 months ago
Reducing the Complexity of ILP Formulations for Synthesis
Integer Linear Programming ILP is commonly used in high level and system level synthesis. It is an NP-Complete problem in general cases. There exists some tools that give an o...
Anne Mignotte, Olivier Peyran
JMMA
2010
162views more  JMMA 2010»
13 years 13 days ago
Co-clustering Documents and Words by Minimizing the Normalized Cut Objective Function
This paper follows a word-document co-clustering model independently introduced in 2001 by several authors such as I.S. Dhillon, H. Zha and C. Ding. This model consists in creatin...
Charles-Edmond Bichot
PAMI
2006
137views more  PAMI 2006»
13 years 5 months ago
Isoperimetric Graph Partitioning for Image Segmentation
Spectral graph partitioning provides a powerful approach to image segmentation. We introduce an alternate idea that finds partitions with a small isoperimetric constant, requiring ...
Leo Grady, Eric L. Schwartz