Sciweavers

651 search results - page 113 / 131
» Index Sets and Universal Numberings
Sort
View
BMCBI
2010
86views more  BMCBI 2010»
13 years 8 months ago
The oligodeoxynucleotide sequences corresponding to never-expressed peptide motifs are mainly located in the non-coding strand
Background: We study the usage of specific peptide platforms in protein composition. Using the pentapeptide as a unit of length, we find that in the universal proteome many pentap...
Giovanni Capone, Giuseppe Novello, Candida Fasano,...
CCR
2002
97views more  CCR 2002»
13 years 7 months ago
Multi-modal network protocols
Most network protocols are uni-modal: they employ a single set of algorithms that allows them to cope well only within a narrow range of operating conditions. This rigid design re...
Rajesh Krishna Balan, Aditya Akella, Srinivasan Se...
CORR
2007
Springer
217views Education» more  CORR 2007»
13 years 7 months ago
Hard constraint satisfaction problems have hard gaps at location 1
An instance of the maximum constraint satisfaction problem (Max CSP) is a nite collection of constraints on a set of variables, and the goal is to assign values to the variables ...
Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen
SIAMDM
2002
94views more  SIAMDM 2002»
13 years 7 months ago
How to Be an Efficient Snoop, or the Probe Complexity of Quorum Systems
A quorum system is a collection of sets (quorums) every two of which intersect. Quorum systems have been used for many applications in the area of distributed systems, including mu...
David Peleg, Avishai Wool
ICDE
2007
IEEE
185views Database» more  ICDE 2007»
14 years 9 months ago
On k-Nearest Neighbor Searching in Non-Ordered Discrete Data Spaces
A k-nearest neighbor (k-NN) query retrieves k objects from a database that are considered to be the closest to a given query point. Numerous techniques have been proposed in the p...
Dashiell Kolbe, Qiang Zhu, Sakti Pramanik