Sciweavers

350 search results - page 49 / 70
» Separation of Partition Inequalities
Sort
View
SIGCOMM
2012
ACM
11 years 9 months ago
Picasso: flexible RF and spectrum slicing
This paper presents the design, implementation and evaluation of Picasso, a novel radio design that allows simultaneous transmission and reception on separate and arbitrary spectr...
Steven Siying Hong, Jeffrey Mehlman, Sachin Rajsek...
COCO
2009
Springer
121views Algorithms» more  COCO 2009»
14 years 1 months ago
Lower Bounds on Quantum Multiparty Communication Complexity
A major open question in communication complexity is if randomized and quantum communication are polynomially related for all total functions. So far, no gap larger than a power o...
Troy Lee, Gideon Schechtman, Adi Shraibman
LICS
2002
IEEE
14 years 8 days ago
Tree Extension Algebras: Logics, Automata, and Query Languages
We study relations on trees defined by first-order constraints over a vocabulary that includes the tree extension relation Ì Ì ¼, holding if and only if every branch of Ì ex...
Michael Benedikt, Leonid Libkin
ECOOP
2000
Springer
13 years 11 months ago
Copying and Comparing: Problems and Solutions
In object oriented programming, it is sometimes necessary to copy objects and to compare them for equality or inequality. We discuss some of the issues involved in copying and comp...
Peter Grogono, Markku Sakkinen
RECOMB
1997
Springer
13 years 11 months ago
A branch-and-cut algorithm for multiple sequence alignment
Multiple sequence alignment is an important problem in computational biology. We study the Maximum Trace formulation introduced by Kececioglu [?]. We first phrase the problem in ...
Knut Reinert, Hans-Peter Lenhof, Petra Mutzel, Kur...