Sciweavers

129 search results - page 20 / 26
» The Parameterized Complexity of the Minimum Shared Edges Pro...
Sort
View
ESA
2006
Springer
111views Algorithms» more  ESA 2006»
15 years 1 months ago
Path Hitting in Acyclic Graphs
An instance of the path hitting problem consists of two families of paths, D and H, in a common undirected graph, where each path in H is associated with a non-negative cost. We r...
Ojas Parekh, Danny Segev
STOC
2010
ACM
224views Algorithms» more  STOC 2010»
15 years 1 months ago
Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
Holger Dell and Dieter van Melkebeek
89
Voted
BMCBI
2007
115views more  BMCBI 2007»
14 years 9 months ago
Recognizing protein-protein interfaces with empirical potentials and reduced amino acid alphabets
Background: In structural genomics, an important goal is the detection and classification of protein–protein interactions, given the structures of the interacting partners. We h...
Guillaume Launay, Raul Mendez, Shoshana J. Wodak, ...
DATE
2010
IEEE
134views Hardware» more  DATE 2010»
15 years 2 months ago
Simultaneous budget and buffer size computation for throughput-constrained task graphs
Abstract—Modern embedded multimedia systems process multiple concurrent streams of data processing jobs. Streams often have throughput requirements. These jobs are implemented on...
Maarten Wiggers, Marco Bekooij, Marc Geilen, Twan ...
WCNC
2008
IEEE
15 years 3 months ago
WiFlex: Multi-Channel Cooperative Protocols for Heterogeneous Wireless Devices
—1 In ISM bands, many wireless protocols proliferate such as 802.11, Bluetooth, and ZigBee. However, these incompatible protocols create complex coexistence and connectivity prob...
Jiwoong Lee, Jeonghoon Mo, Tran Minh Trung, Jean C...