Sciweavers

5153 search results - page 972 / 1031
» Introduction to Randomized Algorithms
Sort
View
BMCBI
2008
144views more  BMCBI 2008»
14 years 10 months ago
Pep-3D-Search: a method for B-cell epitope prediction based on mimotope analysis
Background: The prediction of conformational B-cell epitopes is one of the most important goals in immunoinformatics. The solution to this problem, even if approximate, would help...
Yanxin Huang, Yongli Bao, Shu Yan Guo, Yan Wang, C...
CORR
2010
Springer
170views Education» more  CORR 2010»
14 years 10 months ago
Sidelobe Control in Collaborative Beamforming via Node Selection
Collaborative beamforming (CB) is a power efficient method for data communications in wireless sensor networks (WSNs) which aims at increasing the transmission range in the network...
Mohammed F. A. Ahmed, Sergiy A. Vorobyov
CN
2008
100views more  CN 2008»
14 years 10 months ago
Building resilient low-diameter peer-to-peer topologies
As more applications rely on underlying peer-to-peer topologies, the need for efficient and resilient infrastructure has become more pressing. A number of important classes of top...
Rita H. Wouhaybi, Andrew T. Campbell
CORR
2008
Springer
158views Education» more  CORR 2008»
14 years 10 months ago
Declarative Combinatorics: Isomorphisms, Hylomorphisms and Hereditarily Finite Data Types in Haskell
This paper is an exploration in a functional programming framework of isomorphisms between elementary data types (natural numbers, sets, finite functions, permutations binary deci...
Paul Tarau
ECCC
2006
88views more  ECCC 2006»
14 years 9 months ago
Hardness of Directed Routing with Congestion
Given a graph G and a collection of source-sink pairs in G, what is the least integer c such that each source can be connected by a path to its sink, with at most c paths going th...
Julia Chuzhoy, Sanjeev Khanna