Sciweavers

2626 search results - page 481 / 526
» The complexity of stochastic sequences
Sort
View
IPL
2007
72views more  IPL 2007»
15 years 1 months ago
How to safely close a discussion
In the secure communication problem, we focus on safe termination. In applications such as electronic transactions, we want each party to be ensured that both sides agree on the s...
Gildas Avoine, Serge Vaudenay
BMCBI
2005
134views more  BMCBI 2005»
15 years 1 months ago
Inherited disorder phenotypes: controlled annotation and statistical analysis for knowledge mining from gene lists
Background: Analysis of inherited diseases and their associated phenotypes is of great importance to gain knowledge of underlying genetic interactions and could ultimately give cl...
Marco Masseroli, Osvaldo Galati, Mauro Manzotti, K...
JCP
2007
120views more  JCP 2007»
15 years 1 months ago
Mobile Processes: Enhancing Cooperation in Distributed Mobile Environments
— Currently, context awareness is one of the main trends in distributed mobile computing environments. Against this background, the demand for more complex – and additionally l...
Christian P. Kunze, Sonja Zaplata, Winfried Lamers...
BMCBI
2004
167views more  BMCBI 2004»
15 years 1 months ago
Feature selection for splice site prediction: A new method using EDA-based feature ranking
Background: The identification of relevant biological features in large and complex datasets is an important step towards gaining insight in the processes underlying the data. Oth...
Yvan Saeys, Sven Degroeve, Dirk Aeyels, Pierre Rou...
JACM
2000
131views more  JACM 2000»
15 years 1 months ago
The soft heap: an approximate priority queue with optimal error rate
A simple variant of a priority queue, called a soft heap, is introduced. The data structure supports the usual operations: insert, delete, meld, and findmin. Its novelty is to beat...
Bernard Chazelle