Sciweavers

4536 search results - page 327 / 908
» Contention-Sensitive Data Structures and Algorithms
Sort
View
UAI
1997
15 years 8 months ago
Nonuniform Dynamic Discretization in Hybrid Networks
We consider probabilistic inference in general hybrid networks, which include continuous and discrete variables in an arbitrary topology. We reexamine the question of variable dis...
Alexander V. Kozlov, Daphne Koller
HPCC
2010
Springer
15 years 7 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...
PODS
1999
ACM
160views Database» more  PODS 1999»
15 years 11 months ago
Queries with Incomplete Answers over Semistructured Data
Semistructured data occur in situations where information lacks a homogeneous structure and is incomplete. Yet, up to now the incompleteness of information has not been re ected b...
Yaron Kanza, Werner Nutt, Yehoshua Sagiv
JCB
2006
129views more  JCB 2006»
15 years 6 months ago
GenRate: A Generative Model that Reveals Novel Transcripts in Genome-Tiling Microarray Data
Genome-wide microarray designs containing millions to hundreds of millions of probes are available for a variety of mammals, including mouse and human. These genome tiling arrays ...
Brendan J. Frey, Quaid Morris, Timothy R. Hughes
STOC
2012
ACM
272views Algorithms» more  STOC 2012»
13 years 9 months ago
The cell probe complexity of dynamic range counting
In this paper we develop a new technique for proving lower bounds on the update time and query time of dynamic data structures in the cell probe model. With this technique, we pro...
Kasper Green Larsen