Sciweavers

2957 search results - page 84 / 592
» The Complexity of Polynomial-Time Approximation
Sort
View
COCOON
2008
Springer
13 years 9 months ago
Quasi-bicliques: Complexity and Binding Pairs
Abstract. Protein-protein interactions (PPIs) are one of the most important mechanisms in cellular processes. To model protein interaction sites, recent studies have suggested to f...
Xiaowen Liu, Jinyan Li, Lusheng Wang
PODS
2008
ACM
129views Database» more  PODS 2008»
14 years 7 months ago
Tree-width and functional dependencies in databases
Conjunctive query (CQ) evaluation on relational databases is NP-complete in general. Several restrictions, like bounded tree-width and bounded hypertree-width, allow polynomial ti...
Isolde Adler
PERCOM
2006
ACM
14 years 7 months ago
Maximum Weighted Matching with Interference Constraints
In this paper, we study the problem of utility maximization in multi-hop wireless systems. To study the effect of wireless interference constraints on the utility maximization pro...
Gaurav Sharma, Ness B. Shroff, Ravi R. Mazumdar
INFOCOM
2011
IEEE
12 years 11 months ago
Delay constrained minimum energy broadcast in cooperative wireless networks
—We formulate the problem of delay constrained energy-efficient broadcast in cooperative multihop wireless networks. We show that this important problem is not only NPcomplete, ...
Marjan A. Baghaie, Bhaskar Krishnamachari
LATA
2009
Springer
14 years 9 days ago
On Parallel Communicating Grammar Systems and Correctness Preserving Restarting Automata
Abstract. This paper contributes to the study of Freely Rewriting Restarting Automata (FRR-automata) and Parallel Communicating Grammar Systems (PCGS) as formalizations of the ling...
Dana Pardubská, Martin Plátek, Fried...