Sciweavers

6028 search results - page 1111 / 1206
» Randomness as a resource for design
Sort
View
CCS
2010
ACM
15 years 6 months ago
In search of an anonymous and secure lookup: attacks on structured peer-to-peer anonymous communication systems
The ability to locate random relays is a key challenge for peer-to-peer (P2P) anonymous communication systems. Earlier attempts like Salsa and AP3 used distributed hash table look...
Qiyan Wang, Prateek Mittal, Nikita Borisov
AI
2008
Springer
15 years 6 months ago
Solving quantified constraint satisfaction problems
We make a number of contributions to the study of the Quantified Constraint Satisfaction Problem (QCSP). The QCSP is an extension of the constraint satisfaction problem that can b...
Ian P. Gent, Peter Nightingale, Andrew G. D. Rowle...
ALMOB
2008
131views more  ALMOB 2008»
15 years 6 months ago
Fast algorithms for computing sequence distances by exhaustive substring composition
The increasing throughput of sequencing raises growing needs for methods of sequence analysis and comparison on a genomic scale, notably, in connection with phylogenetic tree reco...
Alberto Apostolico, Olgert Denas
BMCBI
2008
155views more  BMCBI 2008»
15 years 6 months ago
Extending pathways based on gene lists using InterPro domain signatures
Background: High-throughput technologies like functional screens and gene expression analysis produce extended lists of candidate genes. Gene-Set Enrichment Analysis is a commonly...
Florian Hahne, Alexander Mehrle, Dorit Arlt, Annem...
BMCBI
2007
128views more  BMCBI 2007»
15 years 6 months ago
A Bayesian nonparametric method for prediction in EST analysis
Background: Expressed sequence tags (ESTs) analyses are a fundamental tool for gene identification in organisms. Given a preliminary EST sample from a certain library, several sta...
Antonio Lijoi, Ramsés H. Mena, Igor Prü...
« Prev « First page 1111 / 1206 Last » Next »