Sciweavers

78 search results - page 8 / 16
» Minimal Universal Bipartite Graphs
Sort
View
SODA
1992
ACM
123views Algorithms» more  SODA 1992»
13 years 8 months ago
Computing Minimal Spanning Subgraphs in Linear Time
Let P be a property of undirected graphs. We consider the following problem: given a graph G that has property P, nd a minimal spanning subgraph of G with property P. We describe ...
Xiaofeng Han, Pierre Kelsen, Vijaya Ramachandran, ...
BIOINFORMATICS
2006
101views more  BIOINFORMATICS 2006»
13 years 7 months ago
A lock-and-key model for protein-protein interactions
Motivation: Protein-protein interaction networks are one of the major post-genomic data sources available to molecular biologists. They provide a comprehensive view of the global ...
Julie L. Morrison, Rainer Breitling, Desmond J. Hi...
CVPR
2009
IEEE
15 years 2 months ago
Minimizing Sparse Higher Order Energy Functions of Discrete Variables
Higher order energy functions have the ability to encode high level structural dependencies between pixels, which have been shown to be extremely powerful for image labeling pro...
Carsten Rother (Microsoft Research Cambridge), Pus...
SODA
2004
ACM
87views Algorithms» more  SODA 2004»
13 years 8 months ago
Optimal space lower bounds for all frequency moments
We prove that any one-pass streaming algorithm which ( , )-approximates the kth frequency moment Fk, for any real k = 1 and any = 1 m , must use 1 2 bits of space, where m is th...
David P. Woodruff
CORR
2010
Springer
163views Education» more  CORR 2010»
13 years 5 months ago
Faster Algorithms for Semi-Matching Problems
We consider the problem of finding semi-matching in bipartite graphs which is also extensively studied under various names in the scheduling literature. We give faster algorithms ...
Jittat Fakcharoenphol, Bundit Laekhanukit, Danupon...