Sciweavers

533 search results - page 52 / 107
» Protocol synthesis from timed and structured specifications
Sort
View
SBBD
2004
137views Database» more  SBBD 2004»
15 years 2 months ago
A Lock Manager for Collaborative Processing of Natively Stored XML Documents
Today, neither transactional provisions, in general, nor concurrency control, in particular, of DBMS-based processing are tailored to the specific needs of large and collaborative...
Michael Peter Haustein, Theo Härder
UAI
1996
15 years 2 months ago
Topological parameters for time-space tradeoff
In this paper we propose a family of algorithms combining treeclustering with conditioning that trade space for time. Such algorithms are useful for reasoning in probabilistic and...
Rina Dechter
ICC
2007
IEEE
137views Communications» more  ICC 2007»
15 years 7 months ago
Optimality and Complexity of Opportunistic Spectrum Access: A Truncated Markov Decision Process Formulation
— We consider opportunistic spectrum access (OSA) which allows secondary users to identify and exploit instantaneous spectrum opportunities resulting from the bursty traffic of ...
Dejan V. Djonin, Qing Zhao, Vikram Krishnamurthy
SODA
2010
ACM
209views Algorithms» more  SODA 2010»
15 years 10 months ago
Counting Stars and Other Small Subgraphs in Sublinear Time
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...
Mira Gonen, Dana Ron, Yuval Shavitt
BMCBI
2010
132views more  BMCBI 2010»
15 years 1 months ago
Data structures and compression algorithms for high-throughput sequencing technologies
Background: High-throughput sequencing (HTS) technologies play important roles in the life sciences by allowing the rapid parallel sequencing of very large numbers of relatively s...
Kenny Daily, Paul Rigor, Scott Christley, Xiaohui ...