Sciweavers

JGT
2008
92views more  JGT 2008»
13 years 4 months ago
A new upper bound for the bipartite Ramsey problem
We consider the following question: how large does n have to be to guarantee that in any two-colouring of the edges of the complete graph Kn,n there is a monochromatic Kk,k? In th...
David Conlon
BMCBI
2006
141views more  BMCBI 2006»
13 years 4 months ago
Visual setup of logical models of signaling and regulatory networks with ProMoT
Background: The analysis of biochemical networks using a logical (Boolean) description is an important approach in Systems Biology. Recently, new methods have been proposed to ana...
Julio Saez-Rodriguez, Sebastian Mirschel, Rebecca ...
BMCBI
2006
102views more  BMCBI 2006»
13 years 4 months ago
Microarray analysis distinguishes differential gene expression patterns from large and small colony Thymidine kinase mutants of
Background: The Thymidine kinase (Tk) mutants generated from the widely used L5178Y mouse lymphoma assay fall into two categories, small colony and large colony. Cells from the la...
Tao Han, Jianyong Wang, Weida Tong, Martha M. Moor...
CORR
2008
Springer
103views Education» more  CORR 2008»
13 years 4 months ago
Core Persistence in Peer-to-Peer Systems: Relating Size to Lifetime
Distributed systems are now both very large and highly dynamic. Peer to peer overlay networks have been proved efficient to cope with this new deal that traditional approaches can ...
Vincent Gramoli, Anne-Marie Kermarrec, Achour Most...
BMCBI
2008
80views more  BMCBI 2008»
13 years 4 months ago
The XBabelPhish MAGE-ML and XML Translator
Background: MAGE-ML has been promoted as a standard format for describing microarray experiments and the data they produce. Two characteristics of the MAGE-ML format compromise it...
Donald Maier, Farrell Wymore, Gavin Sherlock, Cath...
ARSCOM
2008
103views more  ARSCOM 2008»
13 years 4 months ago
Estimating the number of graphs containing very long induced paths
Let P(n, k) denote the number of graphs on n + k vertices that contain Pn, a path on n vertices, as an induced subgraph. In this note we will find upper and lower bounds for P(n, ...
Steven Butler
WSCG
2003
143views more  WSCG 2003»
13 years 5 months ago
Rendering Large (Volume) Datasets: A new Parallel Visualization System
In this paper we describe a basis for a system that is able to compute actual scientific and realistic visualization methods in parallel. It is capable to integrate easily in mod...
Sascha Schneider, Thorsten May, Michael Schmidt
ICWSM
2008
13 years 6 months ago
A Large-Scale Study of MySpace: Observations and Implications for Online Social Networks
We study the characteristics of large online social net
James Caverlee, Steve Webb
VLDB
2004
ACM
163views Database» more  VLDB 2004»
13 years 10 months ago
Compressing Large Boolean Matrices using Reordering Techniques
Large boolean matrices are a basic representational unit in a variety of applications, with some notable examples being interactive visualization systems, mining large graph struc...
David S. Johnson, Shankar Krishnan, Jatin Chhugani...
ICMCS
2006
IEEE
192views Multimedia» more  ICMCS 2006»
13 years 10 months ago
Low Latency Video Streaming Over Peer-To-Peer Networks
We study peer-to-peer multicast streaming, where a source distributes real-time video to a large population of hosts by making use of their forwarding capacity rather than relying...
Eric Setton, Jeonghun Noh, Bernd Girod