Sciweavers

109 search results - page 20 / 22
» Watermarking Graph Partitioning Solutions
Sort
View
FOCS
2000
IEEE
13 years 9 months ago
Approximating the single source unsplittable min-cost flow problem
Abstract. In the single source unsplittable min-cost flow problem, commodities must be routed simultaneously from a common source vertex to certain destination vertices in a given ...
Martin Skutella
EOR
2010
99views more  EOR 2010»
13 years 5 months ago
Min sum clustering with penalties
Traditionally, clustering problems are investigated under the assumption that all objects must be clustered. A shortcoming of this formulation is that a few distant objects, calle...
Refael Hassin, Einat Or
TMI
2008
140views more  TMI 2008»
13 years 5 months ago
Hamilton-Jacobi Skeleton on Cortical Surfaces
Abstract-- In this paper, we propose a new method to construct graphical representations of cortical folding patterns by computing skeletons on triangulated cortical surfaces. In o...
Yonggang Shi, Paul M. Thompson, Ivo D. Dinov, Arth...
EJWCN
2010
115views more  EJWCN 2010»
13 years 20 days ago
Efficient Certification Path Discovery for MANET
A Mobile Ad Hoc Network (MANET) is characterized by the lack of any infrastructure, absence of any kind of centralized administration, frequent mobility of nodes, network partitio...
Georgios Kambourakis, Elisavet Konstantinou, Anast...
SDM
2009
SIAM
251views Data Mining» more  SDM 2009»
14 years 3 months ago
High Performance Parallel/Distributed Biclustering Using Barycenter Heuristic.
Biclustering refers to simultaneous clustering of objects and their features. Use of biclustering is gaining momentum in areas such as text mining, gene expression analysis and co...
Alok N. Choudhary, Arifa Nisar, Waseem Ahmad, Wei-...