Sciweavers

736 search results - page 131 / 148
» High-order functions and their ordering relations
Sort
View
ICALP
1993
Springer
15 years 1 months ago
Exact Asymptotics of Divide-and-Conquer Recurrences
The divide-and-conquer principle is a majoi paradigm of algorithms design. Corresponding cost functions satisfy recurrences that directly reflect the decomposition mechanism used i...
Philippe Flajolet, Mordecai J. Golin
LCPC
2000
Springer
15 years 1 months ago
Efficient Dynamic Local Enumeration for HPF
In translating HPF programs, a compiler has to generate local iteration and communication sets. Apart from local enumeration, local storage compression is an issue, because in HPF ...
Will Denissen, Henk J. Sips
NSDI
2010
14 years 11 months ago
Scalable WiFi Media Delivery through Adaptive Broadcasts
Current WiFi Access Points (APs) choose transmission parameters when emitting wireless packets based solely on channel conditions. In this work we explore the benefits of deciding...
Sayandeep Sen, Neel Kamal Madabhushi, Suman Banerj...
BMCBI
2010
123views more  BMCBI 2010»
14 years 9 months ago
A new protein binding pocket similarity measure based on comparison of clouds of atoms in 3D: application to ligand prediction
Background: Predicting which molecules can bind to a given binding site of a protein with known 3D structure is important to decipher the protein function, and useful in drug desi...
Brice Hoffmann, Mikhail Zaslavskiy, Jean-Philippe ...
BMCBI
2010
101views more  BMCBI 2010»
14 years 9 months ago
Enrichment of homologs in insignificant BLAST hits by co-complex network alignment
Background: Homology is a crucial concept in comparative genomics. The algorithm probably most widely used for homology detection in comparative genomics, is BLAST. Usually a stri...
Like Fokkens, Sandra M. C. Botelho, Jos Boekhorst,...