Sciweavers

42738 search results - page 8243 / 8548
» Search Computing Systems
Sort
View
111
Voted
RECOMB
2008
Springer
16 years 4 months ago
Bootstrapping the Interactome: Unsupervised Identification of Protein Complexes in Yeast
Protein interactions and complexes are major components of biological systems. Recent genome-wide applications of tandem affinity purification (TAP) in yeast have increased signifi...
Caroline C. Friedel, Jan Krumsiek, Ralf Zimmer
STOC
2005
ACM
164views Algorithms» more  STOC 2005»
16 years 4 months ago
Cooperative asynchronous update of shared memory
The Write-All problem for an asynchronous shared-memory system has the objective for the processes to update the contents of a set of shared registers, while minimizing the mber o...
Bogdan S. Chlebus, Dariusz R. Kowalski
154
Voted
ICALP
2009
Springer
16 years 4 months ago
LTL Path Checking Is Efficiently Parallelizable
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
Lars Kuhtz, Bernd Finkbeiner
211
Voted
SIGMOD
2009
ACM
125views Database» more  SIGMOD 2009»
16 years 4 months ago
Top-k queries on uncertain data: on score distribution and typical answers
Uncertain data arises in a number of domains, including data integration and sensor networks. Top-k queries that rank results according to some user-defined score are an important...
Tingjian Ge, Stanley B. Zdonik, Samuel Madden
SIGMOD
2003
ACM
136views Database» more  SIGMOD 2003»
16 years 4 months ago
A Characterization of the Sensitivity of Query Optimization to Storage Access Cost Parameters
Most relational query optimizers make use of information about the costs of accessing tuples and data structures on various storage devices. This information can at times be off b...
Frederick Reiss, Tapas Kanungo
« Prev « First page 8243 / 8548 Last » Next »