Sciweavers

4860 search results - page 909 / 972
» SNPs Problems, Complexity, and Algorithms
Sort
View
JACM
2000
131views more  JACM 2000»
13 years 9 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
INFORMS
1998
142views more  INFORMS 1998»
13 years 9 months ago
Distributed State Space Generation of Discrete-State Stochastic Models
High-level formalisms such as stochastic Petri nets can be used to model complex systems. Analysis of logical and numerical properties of these models often requires the generatio...
Gianfranco Ciardo, Joshua Gluckman, David M. Nicol
VLDB
2002
ACM
143views Database» more  VLDB 2002»
13 years 9 months ago
SQL Memory Management in Oracle9i
Complex database queries require the use of memory-intensive operators like sort and hashjoin. Those operators need memory, also referred to as SQL memory, to process their input ...
Benoît Dageville, Mohamed Zaït
BMCBI
2008
214views more  BMCBI 2008»
13 years 8 months ago
Enhanced Bayesian modelling in BAPS software for learning genetic structures of populations
Background: During the most recent decade many Bayesian statistical models and software for answering questions related to the genetic structure underlying population samples have...
Jukka Corander, Pekka Marttinen, Jukka Siré...
AMW
2009
13 years 7 months ago
Schema Design for Uncertain Databases
We address schema design in uncertain databases. Since uncertain data is relational in nature, decomposition becomes a key issue in design. Decomposition relies on dependency theo...
Anish Das Sarma, Jeffrey D. Ullman, Jennifer Widom