Sciweavers

1056 search results - page 141 / 212
» Constraint-Based Graph Matching
Sort
View
RECOMB
2006
Springer
14 years 9 months ago
Assessing Significance of Connectivity and Conservation in Protein Interaction Networks
Computational and comparative analysis of protein-protein interaction (PPI) networks enable understanding of the modular organization of the cell through identification of functio...
Mehmet Koyutürk, Ananth Grama, Wojciech Szpan...
SIGECOM
2010
ACM
201views ECommerce» more  SIGECOM 2010»
14 years 1 months ago
Truthful assignment without money
We study the design of truthful mechanisms that do not use payments for the generalized assignment problem (GAP) and its variants. An instance of the GAP consists of a bipartite g...
Shaddin Dughmi, Arpita Ghosh
SODA
2010
ACM
397views Algorithms» more  SODA 2010»
14 years 6 months ago
Improved Approximation Algorithms for the Minimum Latency Problem via Prize-Collecting Strolls
The minimum latency problem (MLP) is a well-studied variant of the traveling salesman problem (TSP). In the MLP, the server's goal is to minimize the average latency that the...
Aaron Archer, Anna Blasiak
FOCS
2006
IEEE
14 years 3 months ago
Lower Bounds for Additive Spanners, Emulators, and More
An additive spanner of an unweighted undirected graph G with distortion d is a subgraph H such that for any two vertices u, v ∈ G, we have δH(u, v) ≤ δG(u, v) + d. For every...
David P. Woodruff
PODS
1999
ACM
160views Database» more  PODS 1999»
14 years 1 months ago
Queries with Incomplete Answers over Semistructured Data
Semistructured data occur in situations where information lacks a homogeneous structure and is incomplete. Yet, up to now the incompleteness of information has not been re ected b...
Yaron Kanza, Werner Nutt, Yehoshua Sagiv