Sciweavers

1396 search results - page 71 / 280
» Succinct Dynamic Data Structures
Sort
View
VLDB
1999
ACM
147views Database» more  VLDB 1999»
15 years 5 months ago
Data-Driven, One-To-One Web Site Generation for Data-Intensive Applications
A data-driven approach can be fruitfully used in the speci cation and automatic generation of data-intensive Web applications, i.e., applications which make large amounts of data ...
Stefano Ceri, Piero Fraternali, Stefano Paraboschi
ICML
2005
IEEE
16 years 2 months ago
Learning first-order probabilistic models with combining rules
Many real-world domains exhibit rich relational structure and stochasticity and motivate the development of models that combine predicate logic with probabilities. These models de...
Sriraam Natarajan, Prasad Tadepalli, Eric Altendor...
LCPC
1998
Springer
15 years 5 months ago
HPF-2 Support for Dynamic Sparse Computations
There is a class of sparse matrix computations, such as direct solvers of systems of linear equations, that change the fill-in (nonzero entries) of the coefficient matrix, and invo...
Rafael Asenjo, Oscar G. Plata, Juan Touriño...
HPCC
2010
Springer
15 years 2 months ago
Insertion Tree Phasers: Efficient and Scalable Barrier Synchronization for Fine-Grained Parallelism
This paper presents an algorithm and a data structure for scalable dynamic synchronization in fine-grained parallelism. The algorithm supports the full generality of phasers with d...
Stefan Marr, Stijn Verhaegen, Bruno De Fraine, The...
BIOCOMP
2009
15 years 2 months ago
Consensus RNA Secondary Structure Prediction by Ranking k-Length Stems
The accurate computational prediction of RNA secondary structures is a difficult task, but an important one, since RNA structure is usually more evolutionarily conserved than prima...
Denise Y. F. Mak, Gary Benson