Sciweavers

87 search results - page 9 / 18
» Combinatorial Complexity of Convex Sequences
Sort
View
MOBIHOC
2007
ACM
14 years 7 months ago
Complexity in geometric SINR
In this paper we study the problem of scheduling wireless links in the geometric SINR model, which explicitly uses the fact that nodes are distributed in the Euclidean plane. We p...
Olga Goussevskaia, Yvonne Anne Oswald, Roger Watte...
CSFW
2009
IEEE
14 years 2 months ago
Minimal Message Complexity of Asynchronous Multi-party Contract Signing
Multi-party contract signing protocols specify how a number of signers can cooperate in achieving a fully signed contract, even in the presence of dishonest signers. This problem h...
Sjouke Mauw, Sasa Radomirovic, Mohammad Torabi Das...
ALGORITHMICA
2007
89views more  ALGORITHMICA 2007»
13 years 7 months ago
The Complexity of the Single Individual SNP Haplotyping Problem
— We present several new results pertaining to haplotyping. These results concern the combinatorial problem of reconstructing haplotypes from incomplete and/or imperfectly sequen...
Rudi Cilibrasi, Leo van Iersel, Steven Kelk, John ...
ICC
2009
IEEE
157views Communications» more  ICC 2009»
14 years 2 months ago
Optimal Relay Assignment and Power Allocation in Selection Based Cooperative Cellular Networks
—We consider a system with a single base station communicating with multiple users over orthogonal channels while being assisted by multiple relays. Several recent works have sug...
Sachin Kadloor, Raviraj Adve
ISAAC
2004
Springer
79views Algorithms» more  ISAAC 2004»
14 years 25 days ago
Paired Pointset Traversal
In the Paired Pointset Traversal problem we ask whether, given two sets A = {a1, . . . , an} and B = {b1, . . . , bn} in the plane, there is an ordering π of the points such that ...
Peter Hui, Marcus Schaefer