Sciweavers

260 search results - page 44 / 52
» Resolution Complexity of Independent Sets in Random Graphs
Sort
View
VLDB
2002
ACM
264views Database» more  VLDB 2002»
14 years 9 months ago
Viator - A Tool Family for Graphical Networking and Data View Creation
Web-based data sources, particularly in Life Sciences, grow in diversity and volume. Most of the data collections are equipped with common document search, hyperlink and retrieval...
Stephan Heymann, Katja Tham, Axel Kilian, Gunnar W...
JCB
2008
91views more  JCB 2008»
14 years 9 months ago
Computational Quantification of Peptides from LC-MS Data
Liquid chromatography coupled to mass spectrometry (LC-MS) has become a major tool for the study of biological processes. High-throughput LC-MS experiments are frequently conducte...
Ole Schulz-Trieglaff, Rene Hussong, Clemens Gr&oum...
CORR
2010
Springer
105views Education» more  CORR 2010»
14 years 4 months ago
Universal and Robust Distributed Network Codes
Random linear network codes can be designed and implemented in a distributed manner, with low computational complexity. However, these codes are classically implemented [1] over fi...
Tracey Ho, Sidharth Jaggi, Svitlana Vyetrenko, Lin...
CP
2007
Springer
15 years 1 months ago
Efficient Computation of Minimal Point Algebra Constraints by Metagraph Closure
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
Alfonso Gerevini, Alessandro Saetti
PVLDB
2010
116views more  PVLDB 2010»
14 years 4 months ago
Schism: a Workload-Driven Approach to Database Replication and Partitioning
We present Schism, a novel workload-aware approach for database partitioning and replication designed to improve scalability of sharednothing distributed databases. Because distri...
Carlo Curino, Yang Zhang, Evan P. C. Jones, Samuel...