Sciweavers

229 search results - page 39 / 46
» On the Number of Arrangements of Pseudolines
Sort
View
JACM
2008
90views more  JACM 2008»
13 years 7 months ago
Bit complexity of breaking and achieving symmetry in chains and rings
We consider a failure-free, asynchronous message passing network with n links, where the processors are arranged on a ring or a chain. The processors are identically programmed bu...
Yefim Dinitz, Shlomo Moran, Sergio Rajsbaum
NAR
2008
103views more  NAR 2008»
13 years 7 months ago
DBD--taxonomically broad transcription factor predictions: new content and functionality
DNA-binding domain (DBD) is a database of predicted sequence-specific DNA-binding transcription factors (TFs) for all publicly available proteomes. The proteomes have increased fr...
Derek Wilson, Varodom Charoensawan, Sarah K. Kumme...
BMCBI
2005
140views more  BMCBI 2005»
13 years 7 months ago
JACOP: A simple and robust method for the automated classification of protein sequences with modular architecture
Background: Whole-genome sequencing projects are rapidly producing an enormous number of new sequences. Consequently almost every family of proteins now contains hundreds of membe...
Peter Sperisen, Marco Pagni
JSAC
2007
103views more  JSAC 2007»
13 years 7 months ago
Impact of Pilot Design on Achievable Data Rates in Multiple Antenna Multiuser TDD Systems
Abstract— In this paper we study the effects of practical pilotassisted channel state estimation on the achievable information theoretic data rates (uplink and downlink) in a mul...
Dragan Samardzija, Narayan B. Mandayam
ALGORITHMICA
2002
93views more  ALGORITHMICA 2002»
13 years 7 months ago
Improved Algorithms for Uniform Partitions of Points
We consider the following one- and two-dimensional bucketing problems: Given a set S of n points in R1 or R2 and a positive integer b, distribute the points of S into b equal-size ...
Pankaj K. Agarwal, Binay K. Bhattacharya, Sandeep ...