Sciweavers

5387 search results - page 128 / 1078
» Generating generic functions
Sort
View
107
Voted
ATAL
2008
Springer
15 years 2 months ago
Decentralised coordination of low-power embedded devices using the max-sum algorithm
This paper considers the problem of performing decentralised coordination of low-power embedded devices (as is required within many environmental sensing and surveillance applicat...
Alessandro Farinelli, Alex Rogers, Adrian Petcu, N...
AIIDE
2009
15 years 1 months ago
Using Semantics to Improve the Design of Game Worlds
Design of game worlds is becoming more and more laborintensive because of the increasing demand and complexity of content. This is being partially addressed by developing semi-aut...
Tim Tutenel, Ruben Michaël Smelik, Rafael Bid...
PRIB
2010
Springer
176views Bioinformatics» more  PRIB 2010»
14 years 10 months ago
An On/Off Lattice Approach to Protein Structure Prediction from Contact Maps
Abstract. An important unsolved problem in structural bioinformatics is that of protein structure prediction (PSP), the reconstruction of a biologically plausible three-dimensional...
Stefano Teso, Cristina Di Risio, Andrea Passerini,...
ECCB
2008
IEEE
15 years 7 months ago
Functional coherence in domain interaction networks
Motivation: Extracting functional information from protein–protein interactions (PPI) poses significant challenges arising from the noisy, incomplete, generic and static nature...
Jayesh Pandey, Mehmet Koyutürk, Shankar Subra...
114
Voted
CRYPTO
2007
Springer
134views Cryptology» more  CRYPTO 2007»
15 years 7 months ago
Domain Extension of Public Random Functions: Beyond the Birthday Barrier
A public random function is a random function that is accessible by all parties, including the adversary. For example, a (public) random oracle is a public random function {0, 1}...
Ueli M. Maurer, Stefano Tessaro