Sciweavers

2084 search results - page 348 / 417
» Proving Time Bounds for Randomized Distributed Algorithms
Sort
View
RECOMB
2004
Springer
15 years 10 months ago
Aligning alignments exactly
d abstract) John Kececioglu and Dean Starrett Department of Computer Science The University of Arizona Tucson AZ 85721, USA A basic computational problem that arises in both the...
John D. Kececioglu, Dean Starrett
ICC
2007
IEEE
303views Communications» more  ICC 2007»
15 years 4 months ago
Diversity and Multiplexing in Cooperative Wireless Cellular Networks
Abstract— In wireless cellular systems, capacity can be increased if both in-cell and out-of-cell cochannel interference (CCI) is properly handled. Moreover, spatial multiplexing...
Diego Piazza, Guido Tartara
P2P
2005
IEEE
119views Communications» more  P2P 2005»
15 years 3 months ago
Search with Probabilistic Guarantees in Unstructured Peer-to-Peer Networks
Search is a fundamental service in peer-to-peer (P2P) networks. However, despite numerous research efforts, efficient algorithms for guaranteed location of shared content in unst...
Ronaldo A. Ferreira, Murali Krishna Ramanathan, As...
CPM
1998
Springer
115views Combinatorics» more  CPM 1998»
15 years 2 months ago
Aligning Alignments
d abstract) John Kececioglu and Dean Starrett Department of Computer Science The University of Arizona Tucson AZ 85721, USA A basic computational problem that arises in both the...
John D. Kececioglu, Weiqing Zhang
CORR
2008
Springer
125views Education» more  CORR 2008»
14 years 9 months ago
Semidefinite programming for N-Player Games
Abstract. We introduce two min-max problems: the first problem is to minimize the supremum of finitely many rational functions over a compact basic semi-algebraic set whereas the s...
Rida Laraki, Jean B. Lasserre