Sciweavers

187 search results - page 30 / 38
» On the Natural Imprint Function of a Graph
Sort
View
96
Voted
BIOCOMP
2008
14 years 11 months ago
GIPSCo: A Method for Comparison of Protein Structures Based on Geometric Invariants
Protein structure comparison is important for elucidation of evolutionary relationships, function and functionally important amino acid residues. We propose Geometric Invariant bas...
Sandeep Deshmukh, Aniket Dalal, Pramod Wangikar
CVIU
2008
180views more  CVIU 2008»
14 years 9 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...
FOCS
2004
IEEE
15 years 1 months ago
Tolls for Heterogeneous Selfish Users in Multicommodity Networks and Generalized Congestion Games
We prove the existence of tolls to induce multicommodity, heterogeneous network users that independently choose routes minimizing their own linear function of tolls versus latency...
Lisa Fleischer, Kamal Jain, Mohammad Mahdian
COCOA
2008
Springer
14 years 11 months ago
Elementary Approximation Algorithms for Prize Collecting Steiner Tree Problems
This paper deals with approximation algorithms for the prize collecting generalized Steiner forest problem, defined as follows. The input is an undirected graph G = (V, E), a colle...
Shai Gutner
SODA
2012
ACM
245views Algorithms» more  SODA 2012»
12 years 12 months ago
Lower bounds for number-in-hand multiparty communication complexity, made easy
In this paper we prove lower bounds on randomized multiparty communication complexity, both in the blackboard model (where each message is written on a blackboard for all players ...
Jeff M. Phillips, Elad Verbin, Qin Zhang